LeetCode 461. Hamming Distance

最新推荐文章于 2023-12-18 09:47:53 发布

jmspan

最新推荐文章于 2023-12-18 09:47:53 发布

阅读量741

点赞数

分类专栏：比特文章标签： leetcode

本文链接：https://blog.csdn.net/jmspan/article/details/53755935

版权

比特专栏收录该内容

16 篇文章 0 订阅

订阅专栏

原题网址：https://leetcode.com/problems/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.

方法：逐个比特扫描比较。

public class Solution {
    public int hammingDistance(int x, int y) {
        int dist = 0;
        while (x != 0 || y != 0) {
            int lx = x & -x;
            int ly = y & -y;
            if (lx == 0) {
                dist++;
                y -= ly;
            } else if (ly == 0) {
                dist++;
                x -= lx;
            } else if (lx < ly) {
                dist++;
                x -= lx;
            } else if (lx > ly) {
                dist++;
                y -= ly;
            } else {
                x -= lx;
                y -= ly;
            }
        }
        return dist;
    }
}