leetcode.461.Hamming Distance

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

_RaymondWong

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

阅读量191

点赞数

分类专栏：刷题笔记 leetcode

本文链接：https://blog.csdn.net/u011607316/article/details/73241974

版权

刷题笔记同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

leetcode

19 篇文章 0 订阅

订阅专栏

Description

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.

sln

这道题就是一个十进制转二进制的问题，诸位将两个十进制数转成二进制数，如果当前位不同则距离自增1。c++实现如下

class Solution {
public:
    int hammingDistance(int x, int y) {
        int dist = 0;
        while (x > 0 || y > 0) {
            int bitX = 0, bitY = 0;
            if (x > 0) {
                bitX = x % 2;
                x /= 2;
            }
            if (y > 0) {
                bitY = y % 2;
                y /= 2;
            }
            dist += (bitX != bitY ? 1 : 0);
        }
        return dist;
    }
};