leetcode461 - Hamming Distance - easy

标签：tput   and   osi   alc   span   nbsp   ++   cal   min   

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.

二进制的数位分离。
每次取到最低位来对比。

实现：

class Solution {
    public int hammingDistance(int x, int y) {
        int ans = 0;
        while (x > 0 || y > 0) {
            if (x % 2 != y % 2) {
                ans++;
            }
            x /= 2;
            y /= 2;
        }
        return ans;
    }
}

leetcode461 - Hamming Distance - easy

标签：tput   and   osi   alc   span   nbsp   ++   cal   min   

原文地址：https://www.cnblogs.com/jasminemzy/p/9736872.html