实现 pow(x, n) ,即计算 x 的 n 次幂函数。
示例 1:
输入: 2.00000, 10输出: 1024.00000
示例 2:
输入: 2.10000, 3输出: 9.26100
示例 3:
输入: 2.00000, -2输出: 0.25000解释: 2-2 = 1/22 = 1/4 = 0.25
说明:
- -100.0 < x < 100.0
- n 是 32 位有符号整数,其数值范围是 [−231, 231 − 1]
方法一:循环n次(超时)
时间复杂度O(n)
public double Power(double x, int n) {
double sum = 1;
long N = n;//考虑Integer.MIN_VALUE
if (n < 0) {
N = -N;
x = 1 / x;
}
while (N > 0) {
sum *= x;
N--;
}
return sum;
}
方法二:快速幂
二分的思想,时间复杂度O(logn)
public double myPow(double x, int n) {
long N = n;//考虑Integer.MIN_VALUE
if (n < 0) {
N=-N;
return 1/helper(x,N);
} else {
return helper(x,N);
}
}
public double helper(double x,long n){
if(n==0){
return 1;
}
if(n==1){
return x;
}
if(n%2==0){
double half=helper(x,n/2);
return half*half;
} else {
return helper(x,n/2)*helper(x,n/2+1);
}
}
如果n比较小(n太大了分配数组空间时OutOfMemoryError),可以采用备忘录法
public double myPow(double x, int n) {
if (n < 0) {
n=-n;
double[] dp=new double[n+1];
return 1/helper(x,n,dp);
} else {
double[] dp=new double[n+1];
return helper(x,n,dp);
}
}
public double helper(double x,int n, double[] dp){
if(n==0){
return 1;
} else if(n==1){
return x;
}
if(dp[n]!=0){
return dp[n];
}
if(n%2==0){
double half=helper(x,n/2,dp);
dp[n]= half*half;
} else {
dp[n]=helper(x,n/2,dp)*helper(x,n/2+1,dp);
}
return dp[n];
}
可以用map来存
public double myPow(double x, int n) {
Map<Integer,Double> map=new HashMap<>();
if (n < 0) {
n=-n;
return 1/helper(x,n,map);
} else {
return helper(x,n,map);
}
}
public double helper(double x,int n, Map<Integer,Double> map){
if(n==0){
return 1;
} else if(n==1){
return x;
}
if(map.get(n)!=null){
return map.get(n);
}
if(n%2==0){
double half=helper(x,n/2,map);
map.put(n, half*half);
} else {
map.put(n,helper(x,n/2,map)*helper(x,n/2+1,map));
}
return map.get(n);
}