1>递归次数过多,栈溢出emm
class Solution {
public double myPow(double x, int n) {
double ans = 1.0;
if(n < 0){
x = 1.0/x;
n = -n;
}else if(n == 0){
return 1;
}
for(int i = 0;i < n;i ++){
ans = x * ans;
}
return ans;
}
}
2>使用快速幂