LeetCode - Pow

我的参考文献

http://www.programcreek.com/2012/12/leetcode-powx-n/

我的AC代码：

public class Solution {        public double zhishu(double x, int n){if (n == 0)return 1; double v = zhishu(x, n / 2); if (n % 2 == 0) {return v * v;} else {return v * v * x;}}    public double pow(double x, int n) {  if (n==0)return 1;else if(n==1)return x;else {if(n > 0)return zhishu(x,n);else{//if((-1)*n % 2 ==0)return 1/zhishu(x,-n);//else//return -1/zhishu(x,-n);}}    }    }