Hamming Distance

标签：ons   pos   output   class   ber   tput   tps   example   个数   

很久没刷leetcode了

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. 两个数异或 z
2. 找出z中1的个数

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

Hamming Distance

标签：ons   pos   output   class   ber   tput   tps   example   个数   

原文地址：http://www.cnblogs.com/luckygxf/p/7707539.html