题目要求:
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?
public class solution_new {
public boolean isPowerOfFour(int num) {
if(num > 0 && (num & 0x55555555) != 0 && (num & num - 1) == 0) return true;
return false;
}
}
判断num 是否大于0;然后进行二进制奇数位的选取;最后要除去2的幂数.