首页 > 其他 > 详细

LeetCode_231. Power of Two

时间:2019-10-25 13:42:56      阅读:88      评论:0      收藏:0      [点我收藏+]

 

231. Power of Two

Easy

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

 

package leetcode.easy;

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

	@org.junit.Test
	public void test() {
		System.out.println(isPowerOfTwo(1));
		System.out.println(isPowerOfTwo(16));
		System.out.println(isPowerOfTwo(218));
	}
}

 

LeetCode_231. Power of Two

原文:https://www.cnblogs.com/denggelin/p/11737225.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!