LeetCode-Java-461. Hamming Distance

最新推荐文章于 2020-07-12 18:13:56 发布

咸鱼塘塘主

最新推荐文章于 2020-07-12 18:13:56 发布

阅读量219

点赞数

分类专栏： LeetCode Java 咸鱼刷LeetCode

本文链接：https://blog.csdn.net/qq_38345606/article/details/81122758

版权

Java 同时被 3 个专栏收录

162 篇文章 0 订阅

订阅专栏

LeetCode

53 篇文章 0 订阅

订阅专栏

咸鱼刷LeetCode

53 篇文章 0 订阅

订阅专栏

题目

建议百度汉明距离

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 num = 0;
        while(x!=0||y!=0)
        {
            if(x%2!=y%2)
                num++;
            x>>=1;
            y>>=1;
        }
        return num;
    }
}