231. Power of Two
来源:互联网 发布:阿里云先知大会 编辑:程序博客网 时间:2024/06/14 15:40
Given an integer, write a function to determine if it is a power of two.
多种解法,可以按之前求isPowerofThree的,也可以考虑PowerofTwo的独特性质,即只有一个位上为1,所以n&(n-1)=0.
class Solution {public: bool isPowerOfTwo(int n) { if(n<=0) { return false; } if((n&(n-1)) == 0) //or if(n == pow(2, round(log(n)/log(2)))) { return true; } return false; }};
0 0
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- 231. Power of Two
- [Array]Contains Duplicate
- 使用C#开发HTTP服务器系列之构建RESTful API
- Oracle TNS监听探讨
- 都是缓存惹的火
- Blender 2.7.7 引用OSL文件的路径问题
- 231. Power of Two
- Windows客户端开发--WMI技术介绍
- php利用微信接口获取微信用户信息
- React Native控件之ViewPagerAndroid讲解
- mysql基础篇---mysql查询语句干货!!!
- 杂
- 【树DP+基环树】[NOI2013]快餐店
- Openstack组件实现原理 — Nova 体系结构
- shell脚本中实现脚本a里面的函数调用脚本b中的函数参数-用到source关键字