Leetcode Hamming Distance

标签：tar   target   wiki   public   tween   tps   运算   highlight   its   

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 < 2³¹.

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.

class Solution {
    public int hammingDistance(int x, int y) {
        int xor = x ^ y, count = 0;
        for (int i=0;i<32;i++) count += (xor >> i) & 1;
        return count;
    }
}

 涉及到位运算。^,&,>>

Leetcode Hamming Distance

标签：tar   target   wiki   public   tween   tps   运算   highlight   its   

原文地址：http://www.cnblogs.com/zzmher/p/7710692.html