## Description

https://leetcode.com/problems/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`

< 2^{31}.

**Example:**

Input:x = 1, y = 4Output:2Explanation:1 (0 0 0 1) 4 (0 1 0 0) ↑ ↑ The above arrows point to positions where the corresponding bits are different.

## Explanation

count how many ‘1’s in x x

## Python Solution

```
class Solution:
def hammingDistance(self, x: int, y: int) -> int:
return bin(x^y).count('1')
```

- Time complexity: O(1).
- Space complexity: O(1).

## One Thought to “LeetCode 461. Hamming Distance”