Given an integer, write a function to determine if it is a power of two.
public class Solution {
public boolean isPowerOfTwo(int n) {
return (n>0 && (n&(n-1)) == 0);
}
}
如果一个数是2的次方,则二进制里面它只有一个1:
2 10
4 100
8 1000
16 10,000
32 100,000
64 1,000,000
128 10,000,000
256 100,000,000
所以n&(n-1)为0