牛客《剑指Offer》 -- 数值的整数次方

题目描述

思路

class Solution {
public:
double Power(double base, int exponent) {
double total = 1;
bool flag = false;
if(exponent<0)   {
flag=true;
exponent = -exponent;
}
for(int i =0;i<exponent;i++){
total = total*base;
}
if(flag)    total = 1/total;
return total;
}
};