GuoXin Li's Blog

LeetCode 461 Hamming Distance 汉明距离

LeetCode
字数统计: 139阅读时长: 1 min
2020/02/18 Share

461. 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.

Resolution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
///Java
class Solution {
    public int hammingDistance(int x, int y) {
        int xor = x^y;
        int ans = 0;
        while(xor > 0){
            if((xor & 1 )== 1){
                ++ans;
            }
            xor >>= 1;
        }
        return ans;
    }
}

Time complexity: O(logn)

Space complexity: O(1)

note：

xor

example: 5^3 = 0110(bit) = 6

while -> continue until 6>>1 -> 0;

CATALOG
  1. 1. 461. Hamming Distance 汉明距离
    1. 1.1. Example:
    2. 1.2. Resolution
Total : 89
2022
2021
2020
2019
2018
essay Deep Learning Paper-reading learning-note C++ CUDA cmake LeetCode DataStructure Numpy OS-Linux PAT slidingwindow git golang BuaaAssignments CG
Machine-Learning Data-Structure