⌨️
LeetCode-python
  • 066. Plus One
  • 002. Add Two Numbers
  • 011. Container With Most Water
  • 045. Jump Game II
  • 055. Jump Game
  • 062. Unique Paths
  • 67. Add Binary
  • 068. Text Justification
  • 069. Sqrt(x)
  • 075. Sort Colors
  • 104. Maximum Depth of Binary Tree
  • 118. Pascal's Triangle
  • 182. Duplicate Emails
  • 191. Number of 1 Bits
  • 202. Happy Number
  • 211. Add and Search Word - Data structure design
  • 238. Product of Array Except Self
  • 258. Add Digits
  • 322. Coin Change
  • 461. Hamming Distance
  • 535. Encode and Decode TinyURL
  • 595. Big Countries
  • 647. Palindromic Substrings
  • 654. Maximum Binary Tree
  • 657. Robot Return to Origin
  • 665. Non-decreasing Array
  • 690. Employee Importance
  • 701. Insert into a Binary Search Tree
  • 704. Binary Search
  • 709. To Lower Case
  • 771. Jewels and Stones
  • 804. Unique Morse Code Words
  • 806. Number of Lines To Write String
  • 807. Max Increase to Keep City Skyline
  • 832. Flipping an Image
  • 849. Maximize Distance to Closest Person
  • 905. Sort Array By Parity
  • 921. Minimum Add to Make Parentheses Valid
  • 929. Unique Email Addresses
  • 938. Range Sum of BST
  • 961. N-Repeated Element in Size 2N Array
  • 977. Squares of a Sorted Array
  • 1021. Remove Outermost Parentheses
  • 1038. Binary Search Tree to Greater Sum Tree
Powered by GitBook
On this page
  • Question 461
  • Answer

461. Hamming Distance

Previous322. Coin ChangeNext535. Encode and Decode TinyURL

Last updated 6 years ago

Question 461

The 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.

Example

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

Answer

class Solution:
    def hammingDistance(self, x, y):
    
        result = x^y
        return bin(result).count('1')
        """
        :type x: int
        :type y: int
        :rtype: int
        """
https://leetcode.com/problems/hamming-distance/description/
Hamming distance