Problem Description
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.
Key Insights
- A power of two has exactly one bit set in its binary representation.
- The only non-positive integer that is a power of two is 1 (2^0).
- For a positive integer n, if n is a power of two, then (n & (n - 1)) should be 0.
- The number must also be greater than 0 since powers of two are positive.
Space and Time Complexity
Time Complexity: O(1)
Space Complexity: O(1)
Solution
The solution involves checking if the number n is greater than 0 and if n & (n - 1) equals 0. This bit manipulation technique effectively determines if n is a power of two by leveraging the properties of binary numbers.