Leetcode: Power of Four

Posted neverlandly

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode: Power of Four相关的知识,希望对你有一定的参考价值。

1 Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
2 
3 Example:
4 Given num = 16, return true. Given num = 5, return false.
5 
6 Follow up: Could you solve it without loops/recursion?

it‘s easy to find that power of 4 numbers have those 3 common features.

First,greater than 0.

Second,only have one ‘1‘ bit in their binary notation,so we use x&(x-1) to delete the lowest ‘1‘,and if then it becomes 0,it prove that there is only one ‘1‘ bit.

Third,the only ‘1‘ bit should be locate at the odd location,for example,16.It‘s binary is 00010000.So we can use ‘0x55555555‘ to check if the ‘1‘ bit is in the right place.With this thought we can code it out easily!

1 public class Solution {
2     public boolean isPowerOfFour(int num) {
3         return (num>0) && ((num & (num-1))==0) && ((num & 0x55555555)!=0);
4     }
5 }

 

以上是关于Leetcode: Power of Four的主要内容,如果未能解决你的问题,请参考以下文章

[leetcode] 342. Power of Four

[LeetCode] Power of Four

342. Power of Four(LeetCode)

LeetCode 342. Power of Four

leetcode 342. Power of Four

[leetcode-342-Power of Four]