works/solutions/leetcode/cpp/231.cpp


1
2
3
4
5
6
7
8
9
10

#include <bitset>

class Solution {
public:
    bool isPowerOfTwo(int n) {
        if (n <= 0) return false;
        std::bitset<sizeof(n) * 8> bits(n);
        return bits.count() == 1;
    }
};