位运算

概念

符号	描述	运算规则
&	与	两个位都为1时，结果才为1
|	或	两个位都为0时，结果才为0
^	异或	两个位相同时为0，相异时为1
~	取反	0变1，1变0
<<	左移	各二进制位全部左移若干位，高位丢弃，低位补0
>>	右移	各二进制位全部右移若干位，对于无符号数，高位补0，有符号数，有的补符号数，有的补0

• 与

x  & 1 == 1 OR == 0 判断奇偶（x % 2 == 1)
x = x (x-1) => 清零最低位的1
x & -x => 得到最低位的1

• 异或

x ^ 0 = x
x ^ x = 0
a ^ b = c => a ^ c = b ,b ^ c = a

leetcode

191.位为1的个数
class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        count = 0
        while (n != 0):
            count += 1
            n = n & (n - 1)
        return count


if __name__ == "__main__":
    s = Solution()
    num = 0b11100001
    print(s.hammingWeight(num))

231. power of two
class Solution(object):
    def isPowerOfTwo(self, n):
        """
        :type n: int
        :rtype: bool
        """
        return (n != 0) & (n & (n - 1) == 0)


if __name__ == "__main__":
    s = Solution()
    num = 16
    print(s.isPowerOfTwo(num))

338. counting bits