题目描述：
Given an integer, write a function to determine if it is a power of two.
解题思路：
判断方法主要依据2的N次幂的特点：仅有首位为1，其余各位都为0.
代码如下：
public class Solution {
public boolean isPowerOfTwo(int n) {
return (n > 0) && ( n & (n - 1)) == 0;
}
}
相关文章
- 09-21[LeetCode] 231 Power of Two && 326 Power of Three && 342 Power of Four
- 09-21Leetcode 231 Power of Two 数论
- 09-21[LeetCode] 231. Power of Two ☆(是否2 的幂)
- 09-21LN : leetcode 231 Power of Two
- 09-21LeetCode 231 Power of Two
- 09-21LeetCode算法题-Intersection of Two Linked Lists（Java实现）
- 09-21【JAVA、C++】LeetCode 004 Median of Two Sorted Arrays
- 09-21【JAVA、C++】LeetCode 002 Add Two Numbers
- 09-21Java 哈希表运用-LeetCode 1 Two Sum
- 09-21leetcode 1. Two Sum [java]