判断一个非负整数是否为2的n次幂？-by大彬

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.

===================位运算===========================

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.

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