461. Hamming Distance leet-code

题目介绍

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 = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

思路

1.两个数求异或
2.计算其1的个数

func hammingDistance(x int, y int) int {    temp := x^y    cnt := 0    for ; temp != 0; {        temp = temp&(temp-1)        cnt++    }    return cnt}