meta data for this page
  •  

Power of Two

Leetcode

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

Solution 1

Solution 1

public boolean isPowerOfTwo(int n) {
  if (n < 0) return false;
  int countOfOnes = 0;
  for (int i = 0; i < 31; i++) {
    int a = ((n >> i) & 1);
    if (((n >> i) & 1) == 1) {
      countOfOnes++;
    }
  }
  return countOfOnes == 1;
}