题目:
Implement pow(x, n).
程序:
class Solution {
public:
double pow(double x, int n) {
//求 x^n = x^(n/2) + x^(n/2) + x^(n%2)
if (n < 0) return 1.0 / power(x, -n);
else return power(x, n);
}
private:
double power(double x, int n) {
if (n == 0) return 1;
double tmp = power(x, n / 2);
if (n % 2 == 0) return tmp * tmp;
else return tmp * tmp * x;
}
};
点评:
直接循环会超时,需要递归求解,翻倍