Welcome to Subscribe On Youtube
231. Power of Two
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 == 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
Follow up: Could you solve it without loops/recursion?
Solutions
-
class Solution { public boolean isPowerOfTwo(int n) { return n > 0 && (n & (n - 1)) == 0; } } -
class Solution { public: bool isPowerOfTwo(int n) { return n > 0 && (n & (n - 1)) == 0; } }; -
class Solution: def isPowerOfTwo(self, n: int) -> bool: return n > 0 and (n & (n - 1)) == 0 -
func isPowerOfTwo(n int) bool { return n > 0 && (n&(n-1)) == 0 } -
function isPowerOfTwo(n: number): boolean { return n > 0 && (n & (n - 1)) === 0; } -
/** * @param {number} n * @return {boolean} */ var isPowerOfTwo = function (n) { return n > 0 && (n & (n - 1)) == 0; }; -
impl Solution { pub fn is_power_of_two(n: i32) -> bool { n > 0 && (n & (n - 1)) == 0 } }