231. Power of Two(easy)

Easy

487136FavoriteShare

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

 

C++:

/*
 * @Author: SourDumplings
 * @Date: 2019-08-25 22:52:07
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/power-of-two/
 * 
 * 所有的2的幂的二进制形式都是一个1后面全是0
 * 它和它减1的数做位与运算一定得0
 */

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

 Java:

/*
 * @Author: SourDumplings
 * @Date: 2019-08-25 23:01:59
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/power-of-two/
 */

class Solution
{
    public boolean isPowerOfTwo(int n)
    {
        if (n <= 0)
        {
            return false;
        }
        return (n & (n - 1)) == 0;
    }
}

 

03-05
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值