Given an integer, write a function to determine if it is a power of two.
solution:
use bit manipulate
public boolean isPowerOfTwo(int n) {
if(n<=0) return false;
if(n == 1) return true;
if(n%2 ==1) return false;
int count = 0;
while(n>0) {
count += n&1;
n = n>>1;
}
if(count == 1) return true;
return false;
}