leetcode #50Pow(x, n)
题目描述:实现 pow(x, n) ,即计算 x 的 n 次幂函数。
方法一:快速幂算法(递归)
class Solution {
public static double myPow(double x, int n) {
long N = n;
if (N < 0) {
x = 1 / x;
N = -N;
}
return fastPow(x, N);
}
public static double fastPow(double x, long n) {
if (n == 0) return 1.00;
double temp = fastPow(x, n >> 1);
if (n % 2 == 0) {
return temp * temp;
} else {
return temp * temp * x;
}
}
}
方法 二:快速幂算法(循环)
class Solution {
public double myPow(double x, int n) {
long N = n;
if (N < 0) {
x = 1 / x;
N = -N;
}
double ans = 1;
double current_product = x;
for (long i = N; i > 0; i /= 2) {
if ((i % 2) == 1) {
ans = ans * current_product;
}
current_product = current_product * current_product;
}
return ans;
}
}