[leetcode] 231. Power of Two

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


Solution 1

Idea: divide n by 2, and check the residual. 

class Solution {
public:
    bool isPowerOfTwo(int n) {
        while (n!=0 && n%2==0){
            n = n/2;
        }
        return n==1;
        
    }
};

Solution 2

Idea: 1 -- 1, 2 -- 10, 4 -- 100,... the highest bits are all 1. If minus 1, the left bit become 0 ,and others become 1s. Do bit logic and, should be 0;

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



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/denny851108/article/details/51564927
文章标签: leetcode easy
个人分类: leetcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

[leetcode] 231. Power of Two

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭