Pow(x, n)
题目:
Implement pow(x, n).
Example 1:
Input: 2.00000, 10
Output: 1024.00000
Example 2:
Input: 2.10000, 3
Output: 9.26100
answer:
简要:利用递归就可以解决了
class Solution {
public:
double pow(double x, int n) {
if (n==0) return 1;
double t = pow(x,n/2);
if (n%2) {
return n<0 ? 1/x*t*t : x*t*t;
} else {
return t*t;
}
}