# LeetCode – 461. Hamming Distance

### 題目來源：LeetCode – 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 1:

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.

1的bit為0 0 0 1

4的bit為0 1 0 0

#### 解法：

Leetcode顯示這方法勝過了89%的人，執行速度10ms

## One comment

1. thank you for sharing