LeetCode之旅(19)-Power of Two
来源:互联网 发布:mac什么打开exe文件 编辑:程序博客网 时间:2024/06/05 08:36
题目
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.
思路
判断一个整数,是不是的2的次方数 ,利用对2求余,来循环除以2,看最后是不是1
代码:
public class Solution { public boolean isPowerOfTwo(int n) { if(n <= 0){ return false; }else{ while(n % 2 == 0){ n = n/2; } return n == 1; } }}
0 0
- LeetCode之旅(19)-Power of Two
- LeetCode之Power of Two
- leetcode 之 power of two
- leetcode之Power of Two
- leetcode之Power of Two
- LeetCode之Power of Two
- 【菜鸟的leetcode之旅】231.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
- 设计模式之简单工厂方法模式和工厂方法模式
- 轻松记住大端小端的含义(附对大端和小端的解释)
- HTTP状态码一览表
- 数据结构笔记及Java实现 (排序)
- XML语法及其约束
- LeetCode之旅(19)-Power of Two
- Spring的<aop:aspectj-autoproxy>配置
- ListView(乱跳问题完美(包括点击闪动)解决_每一个条目都做动画_不复用convertview20160402)
- VS2010 环境下链接 IVF2011 编译的 Fortran 静态库问题
- Java之 string 类型比大小
- 同步问题
- cocos2dx3.9 lua继承Layer
- Linux操作系统 (RHEL 7/CentOS 7)
- 1025:To the max(DP)