Implement pow(x, n), which calculates x raised to the power n (xn).
Example 1:
Input: 2.00000, 10 Output: 1024.00000
Example 2:
Input: 2.10000, 3 Output: 9.26100
Example 3:
Input: 2.00000, -2 Output: 0.25000 Explanation: 2-2 = 1/22 = 1/4 = 0.25
Note:
- -100.0 < x < 100.0
- n is a 32-bit signed integer, within the range [−231, 231 − 1]
实现一下指数运算,这里注意两点:
1. 注意时间复杂度。我开始用了for循环,一个数一个数相乘,提示超时。这里采用了二分法优化。
2. 会出现n=INT_MIN的情况。INT_MIN==-2147483648会溢出,所以要特别处理。
class Solution {
public:
double myPow(double x, int n) {
if(n==0)
return 1;
if(n<0){
if (n == INT_MIN) {
return myPow(x, n + 1) * myPow(x, -1); //avoid overflow from n *= -1 INT_MIN+1后变成-2147483647
}
n = -n;
x = 1/x;
}
return (n%2==0)? myPow(x*x, n/2): x*myPow(x*x, n/2);
}
};