码迷,mamicode.com
首页 > 其他好文 > 详细

Fast Power

时间:2016-08-18 06:30:10      阅读:138      评论:0      收藏:0      [点我收藏+]

标签:

Calculate the an % b where a, b and n are all 32bit integers.

 

Analyse: divide and conquer. Be aware of overflow. 

Runtime: 12ms

 1 class Solution {
 2 public:
 3     /*
 4      * @param a, b, n: 32bit integers
 5      * @return: An integer
 6      */
 7     int fastPower(int a, int b, int n) {
 8         // write your code here
 9         if (!a || b == 1 || n < 0) return 0;
10         if (!n && b != 1) return 1;
11         if (n == 1) return a % b;
12         
13         long temp1 = fastPower(a, b, n / 2);
14         long temp = temp1 * temp1 % b;
15         if (n % 2) temp *= a % b;
16         return (int)(temp % b);
17     }
18 };

 

Fast Power

标签:

原文地址:http://www.cnblogs.com/amazingzoe/p/5782538.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!