461 Hamming Distance

1. Description

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

 

constraints :

• 0 <= x, y <= \(2^{31}\) - 1

2. Algorithms

Logical operator XOR returns 1 when corresponding bits are different. After we apply XOR between x and y, we just return counts of "1".

1. Start
2. Apply XOR operator(^) between x and y.
3. Change result of logical operation into bit representation.
4. Count "1" in binary representations and return result.
5. End

3. Codes

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

4. Conclusion