Welcome to Subscribe On Youtube

461. Hamming Distance

Description

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

Solutions

Use xor operation to find different bits.

• 0 ^ 0 = 0
• 1 ^ 1 = 0
• 0 ^ 1 = 1
• 1 ^ 0 = 1

• Java
• C++
• Python
• Go
• TypeScript
• Javascript

• class Solution {
      public int hammingDistance(int x, int y) {
          return Integer.bitCount(x ^ y);
      }
  }
  

• class Solution {
  public:
      int hammingDistance(int x, int y) {
          return __builtin_popcount(x ^ y);
      }
  };
  

• class Solution:
      def hammingDistance(self, x: int, y: int) -> int:
          return (x ^ y).bit_count()
  
  

• func hammingDistance(x int, y int) int {
  	return bits.OnesCount(uint(x ^ y))
  }
  

• function hammingDistance(x: number, y: number): number {
      x ^= y;
      let ans = 0;
      while (x) {
          x -= x & -x;
          ++ans;
      }
      return ans;
  }
  
  

• /**
   * @param {number} x
   * @param {number} y
   * @return {number}
   */
  var hammingDistance = function (x, y) {
      x ^= y;
      let ans = 0;
      while (x) {
          x -= x & -x;
          ++ans;
      }
      return ans;
  };
  
  

All Problems

All Solutions