LeetCode50-Pow
50. Pow(x, n):
实现 pow(x, n),即计算 x 的 n 次幂函数(即,x^n )。
示例 1:
输入:x = 2.00000, n = 10
输出:1024.00000
示例 2:
输入:x = 2.10000, n = 3
输出:9.26100
示例 3:
输入:x = 2.00000, n = -2
输出:0.25000
解释:2-2 = 1/22 = 1/4 = 0.25
提示:
- -100.0 < x < 100.0
- -2^31 <= n <= 2^31-1
- -10^4 <= xn <= 10^4
解题思路1:
快速幂模板,注意负数溢出就行,用longlong来保存一下-n
class Solution {
double quickMul(double x,long long n) {
double ans=1;
while(n>0) {
if(n&1)
ans*=x;
x*=x;
n>>=1;
}
return ans;
}
public:
double myPow(double x, int n) {
if(x==0)
return 0;
long long N=n;
return n>0?quickMul(x,N):1.0/quickMul(x,-N);
}
};