leetcode 231

231. Power of Two

• Total Accepted: 86376
• Total Submissions: 228380
• Difficulty: Easy

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.

Subscribe to see which companies asked this question

思路：问n是否为2的次方，也就是使用移位操作计算n的二进制数是否只有一个1；

code:

public class Solution {
    public boolean isPowerOfTwo(int n) {
        
        return numofOne(n) == 1 ? true : false;
    }
    
    public int numofOne(int n){
        int bits = 0;
        while(n > 0){
            if((n&1) != 0){
                bits++;
            }
            n >>= 1;
        }
        return bits;
    }
}