题目:
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)
(2)
(3)
当 n == INT_MIN, -n = INT_MAX + 1溢出
因此,先使用公式1,再使用公式三
class Solution {
public:
double myPow(double x, int n) {
if(n == 0)
return 1;
if(n == INT_MIN)
{
x = x * x;
n = n/2;
}
if(n < 0){
n = -n;
x = 1/x;
}
return (n % 2 == 0)? myPow(x * x, n/2) : x * myPow(x * x, n/2);
}
};