Day 2 of 100 Days LeetCode Challenge

LeetCode Problem #231. 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
Video Solution
Java Solution
				
					class Solution {
    public boolean isPowerOfTwo(int x) {
      if(x==0){
          return false;
      }

      while(x%2==0){
          x = x/2 ;
      }

      if(x==1){
          return true ;
      }else{
          return false; 
      }
    }
}
				
			
Flowchart of Java Solution
Flowchart of LeetCode Problem 231 - Power of Two
Python Solution
				
					def is_power_of_two(n):
        if n <= 0:
            return False
        return (n & (n - 1)) == 0
				
			

Happy Coding with edSlash