50. Pow(x, n)

Implement pow(xn).

题目含义:实现x的n次方

 1     private double power(double x,int n)
 2     {
 3         if (n == 0) return 1;
 4         double halfPower = power(x, n / 2);
 5         if (n % 2 == 0) return halfPower * halfPower;
 6         else return halfPower * halfPower * x;
 7     }
 8     
 9     public double myPow(double x, int n) {
10         if (n<0) return 1/power(x,-n);
11         return power(x,n);        
12     }

 

posted @ 2017-10-24 15:46  daniel456  阅读(112)  评论(0编辑  收藏  举报