"Leetcode 231" Power of

Given an integer, write a function to determine if it is a power of.

Ideas:

If a number is 2 power, then only one of the binary strings is 1, and the rest is 0. Execute N & (n-1) to eliminate the lowest bit of a 1, if the elimination is 0, then the number is 2 power (n = = 0 | | n = =-2147483648 for special consideration).

C++:

1 classSolution {2  Public:3     BOOLIspoweroftwo (intN) {4         if(n = =0|| n = =-2147483648)5             return false;6         7n = n & (N-1);8         9         if(n = =0)Ten             return true; One         Else A             return false; -     } -};

Python:

1 classSolution:2     #@param {integer} n3     #@return {Boolean}4     defispoweroftwo (self, n):5         ifn = = 0orn = =-2147483648:6             returnFalse7         8n = N & (n-1)9         Ten         ifn = =0: One             returnTrue A         Else: -             returnFalse

"Leetcode 231" Power of