Skip to content

Latest commit

 

History

History
30 lines (18 loc) · 514 Bytes

README.md

File metadata and controls

30 lines (18 loc) · 514 Bytes

50.Hamming Distance

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.

From

LeetCode