【一天一道LeetCode】#231. Power of Two
来源:互联网 发布:剑灵捏脸数据怎么下载 编辑:程序博客网 时间:2024/06/16 21:42
一天一道LeetCode
本系列文章已全部上传至我的github,地址:ZeeCoder‘s Github
欢迎大家关注我的新浪微博,我的新浪微博
欢迎转载,转载请注明出处
(一)题目
Given an integer, write a function to determine if it is a power of two.
(二)解题
题目大意:判断一个数是不是2的n次方。
解题思路:从二进制位运算来看,2的n次方是诸如0001,0010,0100,1000….等数,所以采用位运算,n&(n-1)如果为0表示是2的n次方,否则不是。
class Solution {public: bool isPowerOfTwo(int n) { return n<=0?false:!(n&(n-1)); }};
0 0
- 【一天一道LeetCode】#231. Power of Two
- 【一天一道LeetCode】#326. Power of Three
- 【一天一道LeetCode】#342. Power of Four
- [leetcode] 231.Power of Two
- LeetCode ||231. Power of Two
- [LeetCode]231.Power of Two
- Leetcode 231. Power of Two
- leetcode 231. Power of Two
- 231. Power of Two LeetCode
- [LeetCode]231. Power of Two
- [LeetCode]231. Power of Two
- LeetCode 231. Power of Two
- [leetcode] 231. Power of Two
- leetcode 231. Power of Two
- LeetCode *** 231. Power of Two
- leetcode 231. Power of Two
- LeetCode 231. Power of Two
- Leetcode-231. Power of Two
- Broadcasting
- C++ 模板类的实现为何放在.h中
- spring IOC容器接口体系简介
- 【一天一道LeetCode】#326. Power of Three
- Spring学习笔记四: 从Spring容器中获取Bean
- 【一天一道LeetCode】#231. Power of Two
- 根据表结构自动生成JavaBean,史上最强最专业的表结构转JavaBean的工具(第4版)
- The Unique MST
- 【一天一道LeetCode】#191. Number of 1 Bits
- 使用ob缓冲技术实现页面真静态
- hadoop学习笔记—基础篇
- leetcode:Repeated DNA Sequences
- Binary Tree Level Order Traversal II
- Java学习笔记之多态