Leetcode 231. Power of Two

Problem

Given an integer n, return true if it is a power of two. Otherwise, return false.

An integer n is a power of two, if there exists an integer x such that $n==2^x$.

Algorithm

Implement using 2’s complement.

Code

class Solution:
    def isPowerOfTwo(self, n: int) -> bool:
        if n <= 0:
            return False
        m = n & ~(n - 1)
        return m == n