【leetcode】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

class Solution {
public:
    bool isPowerOfTwo(int n) {
     // 判断n是否是2的指数值 除法利用移位计算加速
        while(n>1){
            if(n&1) break; // 如果是奇数直接返回
            n=n>>1;// 右移运算
        }
        return (n==1);
    }
};