231. Power of Two
Given an integer, write a function to determine if it is a power of two.
Example 1:
Input: 1
Output: true
Explanation: 20 = 1
Example 2:
Input: 16
Output: true
Explanation: 24 = 16
Example 3:
Input: 218
Output: false
方法1: bit manipulation
思路:
class Solution {
public:
bool isPowerOfTwo(int n) {
int sum = 0;
while (n > 0) {sum += (n & 1) ? 1: 0; n >>= 1;}
return sum == 1;
}
};