leetcode_461 Hamming Distance

标签：integer   osi   and   its   distance   nbsp   http   pos   exp   

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.

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

异或变形

leetcode_461 Hamming Distance

标签：integer   osi   and   its   distance   nbsp   http   pos   exp   

原文地址：http://www.cnblogs.com/ytq1016/p/6757647.html