Time complexity: O(log n) Space complexity: O(1)

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

Author: Gowsika23

0231. Power of Two

@@ -0,0 +1,14 @@
+class Solution {
+    public boolean isPowerOfTwo(int n) {
+        if (n == 0) return false;
+        
+        while (n > 0) {
+            if (n == 1) return true;
+            if (n % 2 != 0) break;
+            n /= 2;
+        }
+        return false;
+    }
+}
+        
+