首页 > 其他 > 详细

342. Power of Four(LeetCode)

时间:2017-05-15 11:51:04      阅读:230      评论:0      收藏:0      [点我收藏+]

Given an integer (signed 32 bits), write a function to check whether it is a power of 4.

Example:
Given num = 16, return true. Given num = 5, return false.

Follow up: Could you solve it without loops/recursion?

 1 class Solution {
 2 public:
 3     bool isPowerOfFour(int num) {
 4          if (num == 0)
 5             return false;
 6         while (num != 1)
 7         {
 8             if (num % 4 != 0)
 9                 break;
10             else
11             {
12                 num = num / 4;
13             }
14         }
15         if (num == 1)
16             return true;
17         else
18             return false;
19     }
20 };

 

342. Power of Four(LeetCode)

原文:http://www.cnblogs.com/wujufengyun/p/6855598.html

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