leetcode 231. Power of Two

Given an integer, write a function to determine if it is a power of two.

判断一个整数 n 是否是 2 的乘方。

之前做了Power of Three，再看这道题就是小case啦。

public boolean isPowerOfTwo(int n) {
	return n>0&&1073741824%n==0;
}

大神还想到了用一种Bit operation方法：

如果 n 是 2 的乘方:

• n = 2 ^ 0 = 1 = 0b0000...00000001, and (n - 1) = 0 = 0b0000...0000.
• n = 2 ^ 1 = 2 = 0b0000...00000010, and (n - 1) = 1 = 0b0000...0001.
• n = 2 ^ 2 = 4 = 0b0000...00000100, and (n - 1) = 3 = 0b0000...0011.
• n = 2 ^ 3 = 8 = 0b0000...00001000, and (n - 1) = 7 = 0b0000...0111.

因此我们得出 n & (n-1) == 0b0000...0000 == 0  的结论
如果 n 不是 2 的乘方, n & (n-1) != 0
比如, n =14 = 0b0000...1110, and (n - 1) = 13 = 0b0000...1101。

 public boolean isPowerOfTwo(int n) {
    return n>0 && ((n & (n-1)) == 0);
}

见 http://bits.stephan-brumme.com/isPowerOfTwo.html

大神还有一个cheat方法。2 的乘方数的二进制表达只有 1 个 1。

public class Solution {
    public boolean isPowerOfTwo(int n) {
        return n>0 && Integer.bitCount(n) == 1;
    }
}