【Leetcode】461. Hamming Distance

461. Hamming Distance

https://leetcode.com/problems/hamming-distance/description/

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, calculate the Hamming distance.

Note:
0 ≤ x, y < 231.

Example:

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

The above arrows point to positions where the corresponding bits are different.

Hamming distance : 就是指两个数用二进制表示之后，不同位数的个数

sol1:

class Solution:
    def hammingDistance(self, x, y):
        return bin(x^y).count('1')

笔记：x^y 按位异或运算符：当两对应的二进位相异时，结果为1，其余结果为0

           bin函数：返回一个整型的二进制表示

           count函数：计数

             

sol2:

class Solution:
    def hammingDistance(self, x, y):
        return len([i for i in format(x^y,'b') if i == '1'])

笔记：print format(4,'b') 

         输出 ：'100' (转化成二进制)