[Solved] The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, return the Hamming distance between them.

Leetcode solutions MLP Feature Image

Table of Contents

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, return the Hamming distance between them.

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.

Example 2:

Input: x = 3, y = 1
Output: 1

Constraints:

  • 0 <= x, y <= 231 - 1

Python Solution

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

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top