Leetcode练习 461. Hamming Distance

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.

基本思路就是异或之后统计数字当中1的个数，也是编程之美中有的一个问题

public class Solution { public int hammingDistance(int x, int y) { int cnt = 0; int z = x ^ y; while(z!=0){ cnt += z & 1; z >>= 1; //z &= z - 1; //cnt++; } return cnt; } }