这题看似简单,其实还是有许多技巧的,不能忽视。
class Solution {
public:
double Power(double base, int exponent) {
if(exponent == 0)
return 1;
int absexponent = exponent;
if(exponent<0)
absexponent = -exponent;
double result = unsignedpower(base,(unsigned int)absexponent);
if(exponent<0)
result = 1/ result ;//复数次幂可以转换正数次幂分之一
return result;
}
//乘方问题可以递归的解决
double unsignedpower(double base, unsigned int exponent)
{
if(exponent == 0)
return 1;
if(exponent == 1)
return base;
double result = unsignedpower(base,exponent>>1);
result *= result;
if(exponent & 0x01)//求余可以用位运算
result *= base;
return result;
}
};