首页 > 其他 > 详细

Pow(x, n)

时间:2016-08-10 00:51:02      阅读:200      评论:0      收藏:0      [点我收藏+]

Implement pow(xn).

 

Analyse: Be aware of corner cases. For exmaple, x = 0, n = 0, n = 1, and n < 0. Note the highlited area, if n == INT_MIN, we have to use braces to ensure the correctness. 

Runtime: 4ms.

 1 class Solution {
 2 public:
 3     double myPow(double x, int n) {
 4         if(!x) return 0.0;
 5         if(!n) return 1.0;
 6         if(n == 1) return x;
 7         
 8         if(n < 0) {
 9             double temp = myPow(1 / x, -(n / 2));
10             return temp * temp * myPow(1 / x, -(n % 2));
11         }
12         else{
13             double temp = myPow(x, n / 2);
14             return temp * temp * myPow(x, n % 2);
15         }
16     }
17 };

 

Pow(x, n)

原文:http://www.cnblogs.com/amazingzoe/p/5755137.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!