Power of Two LeetCode Solution | Easy Approach

Minimum Cost to Merge Stones
Share:

Power of Two 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 == 2x.

Example 1:

Input: n = 1
Output: true
Explanation: 20 = 1

Example 2:

Input: n = 16
Output: true
Explanation: 24 = 16

Example 3:

Input: n = 3
Output: false

Constraints:

  • -231 <= n <= 231 - 1

Power of Two Solutions

Time: O(1)
Space: O(1)

C++

class Solution {
 public:
  bool isPowerOfTwo(int n) {
    return n < 0 ? false : __builtin_popcountll(n) == 1;
  }
};

Java

 class Solution {
  public boolean isPowerOfTwo(int n) {
    return n < 0 ? false : Integer.bitCount(n) == 1;
  }
}

Python

  class Solution:
  def isPowerOfTwo(self, n: int) -> bool:
    return False if n < 0 else bin(n).count('1') == 1

Watch Tutorial

Checkout more Solutions here

Leave a Comment

Your email address will not be published. Required fields are marked *

x