Hamming Distance

最新推荐文章于 2023-06-28 09:18:16 发布

转载最新推荐文章于 2023-06-28 09:18:16 发布 · 50 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ordili/p/6515658.html

本文介绍如何计算两个整数之间的汉明距离，即对应位不同的数量，并提供了一个Java实现方法。

1. Title

461. Hamming Distance

2. Http address

https://leetcode.com/problems/hamming-distance/?tab=Description

3. The question

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.

4. Code

public class Solution {
    public int hammingDistance(int x, int y) {
        
        String xbits = Integer.toBinaryString(x);
        String ybits = Integer.toBinaryString(y);

        int lenX = xbits.length();
        int lenY = ybits.length();
        int re = 0, i = 0, j = 0;
        if (lenX > lenY) {
            for (i = 0; i < lenX - lenY; i++) {
                if (xbits.charAt(i) != '0') {
                    re++;
                }
            }

        } else {
            for (j = 0; j < lenY - lenX; j++) {
                if (ybits.charAt(j) != '0') {
                    re++;
                }
            }
        }

        while (i < lenX && j < lenY) {
            if (xbits.charAt(i++) != ybits.charAt(j++)) {
                re++;
            }
        }

        return re;
    
    }
}