leetcode之Power of Two
来源:互联网 发布:西门子plc编程入门教程 编辑:程序博客网 时间:2024/05/23 15:47
Given an integer, write a function to determine if it is a power of two.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question;
该题判断一个数是否为2的幂,这里利用的是二进制的方法,如果一个数为2的幂,则只有首位为1,所以与其减一的结果相与的结果为0。
class Solution {public: bool isPowerOfTwo(int n) { if(n>0){ return (!(n&(n-1))); } else return false; }};
1 0
- LeetCode之Power of Two
- leetcode 之 power of two
- leetcode之Power of Two
- leetcode之Power of Two
- LeetCode之Power of Two
- [LeetCode] Power of Two
- 【LeetCode】Power of Two
- [Leetcode]Power of Two
- [leetCode] Power of Two
- leetcode --Power of Two
- leetcode: Power of Two
- LeetCode Power of Two
- [LeetCode] Power of Two
- LeetCode Power of Two
- [leetcode] Power of Two
- [Leetcode]Power of Two
- Leetcode: Power of Two
- [LeetCode]Power of Two
- 训练赛20160406_华中OJ
- HDU 1695(容斥+欧拉函数+素数分解)
- Liunx 搜索命令
- 自己动手写操作系统之1:bochs初步使用
- Android-Proguard代码混淆
- leetcode之Power of Two
- document.ready和onload的区别——JavaScript文档加载完成的那点事儿
- 斐波那契数列
- Java中关于getInstance方法的阐述
- asp 为 datalist 添加 增删改 事件
- 离线Markdown编辑器推荐
- Servlet与web.xml传值问题
- keepalive安装配置
- 关于linux系统中的权限