231. Power of Two

作者: 铭小狮子酱 | 来源:发表于2020-06-09 07:01 被阅读0次

思路

2的倍数的二进制特点是首位为1,则满足
$(n \& (n-1)) == 0$
注意最外层的括号不能省。

代码(cpp)

class Solution {
public:
    bool isPowerOfTwo(int n) {
        return  n > 0 && (n & (n - 1)) == 0;
    }
};

LeetCode #231 #326 #342 2018-08-
231. Power of Two https://leetcode.com/problems/power-of-...
Leetcode-Java(二十四)
231. Power of Two 232. Implement Queue using Stacks 题目中要求...
LeetCode 231-240
231. 2的幂[https://leetcode-cn.com/problems/power-of-two/] ...
Leecode 位运算
231. 2的幂[https://leetcode-cn.com/problems/power-of-two/] ...
Power of Two Three Four 2018-04-
231. Power of Two 2 4 8 16 32 64 4 different ways to solv...
231. Power of Two
技巧性非常强如果是2的幂次方则有（x & (x-1) == 0）
231. Power of Two
Problem Given an integer, write a function to determine i...
231. Power of Two
黑人问号脸的嗯递归
231. Power of Two
解题思路题目链接，登录 LeetCode 后可用题目要求是判断一个数是不是 2 的次方数，第一个思路就是跟判断一...
231. Power of Two
1.描述 Given an integer, write a function to determine if i...

本文标题：231. Power of Two

本文链接：https://www.haomeiwen.com/subject/aymjtktx.html