跳转至

231.Power of Two

Tags: Easy Bit Manipulation

Links: https://leetcode.com/problems/power-of-two/


Given an integer, write a function to determine if it is a power of two.

Example 1:

Input: 1
Output: true 
Explanation: 20 = 1

Example 2:

Input: 16
Output: true
Explanation: 24 = 16

Example 3:

Input: 218
Output: false

class Solution {
public:
    bool isPowerOfTwo(int n) {
        std::ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);

        return (n > 0) && !(n & (n - 1));
    }
};