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?
My Solution:
public class Solution {
public boolean isPowerOfFour(int num) {
String data=Integer.toBinaryString(num);
if(num>0&&(data.length()-1)%2==0){
if(data.substring(1).contains("1"))
return false;
else
return true;
}
else
return false;
}
}
a better solution:
public class Solution {
public boolean isPowerOfFour(int num) {
return num > 0 && (num&(num-1)) == 0 && (num & 0x55555555) != 0;
}
}