题目要求实现这个函数。
public double pow(double x, int n)
看上去这道题目很简单,其实有不少中间细节需要注意,尤其是leetcode设置的测试案例。这道题讨论区提到了一个非常精巧的办法:
Consider the binary representation of n. For example, if it is "10001011", then x^n = x^(1+2+8+128) = x^1 * x^2 * x^8 * x^128. Thus, we don't want to loop n times to calculate x^n. To speed up, we loop through each bit, if the i-th bit is 1, then we add x^(1 << i) to the result. Since (1 << i) is a power of 2, x^(1<<(i+1)) = square(x^(1<<i)). The loop executes for a maximum of log(n) times.
特别需要注意的几个点:
1.x取值为0时,0的正数次幂是1,而负数次幂是没有意义的;判断x是否等于0不能直接用“==”。
2.对于n取值INT_MIN时,-n并不是INT_MAX,这里不处理好会报错:栈溢出。这时需要格外小心。测试案例中就有 pow(1.00000, -2147483648)
public class Solution {
public static double pow(double x, int n)
{
if(n==0){
return 1;
}
if(n<0){
if(n==Integer.MIN_VALUE){
return 1.0/(pow(x, Integer.MAX_VALUE)*x);
}else {
return 1.0/pow(x, -n);
}
}
double ans = 1.0 ;
for(; n>0; x *= x, n>>=1)
{
if(((byte)n & 1) >0)
ans *= x;
}
return ans;
}
}