【LeetCode】231. Power of Two

231. Power of Two

Easy

364106FavoriteShare

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

解决方案：

class Solution {
    public boolean isPowerOfTwo(int n) {
       if (n <= 0) {
            return false;
        }
        //Math.log2 以2为底的对数
        //Math.round  求距离某数最近的整数，返回int型或者long型
        if (Math.pow(2, Math.round(Math.log(n) / Math.log(2))) == n) {
            return true;
        } 
        return false;
    }
}