hamming-distance

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

The <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers is the number of positions at which the corresponding bits are different.

Given two integers <code>x</code> and <code>y</code>, return the Hamming distance between them.

&nbsp;
Example 1:

<pre>
Input: x = 1, y = 4
Output: 2
Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
 &uarr; &uarr;
The above arrows point to positions where the corresponding bits are different.
</pre>

Example 2:

<pre>
Input: x = 3, y = 1
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;=&nbsp;x, y &lt;= 231 - 1</code></li>
</ul>

&nbsp;
Note: This question is the same as <a href="https://leetcode.com/problems/minimum-bit-flips-to-convert-number/description/" target="_blank"> 2220: Minimum Bit Flips to Convert Number.</a>

hammingDistance

Hamming Distance

Number of 1 Bits

number-of-1-bits

位1的个数

Total Hamming Distance

total-hamming-distance

汉明距离总和

Bit Manipulation

两个整数之间的 <a href="https://baike.baidu.com/item/%E6%B1%89%E6%98%8E%E8%B7%9D%E7%A6%BB">汉明距离</a> 指的是这两个数字对应二进制位不同的位置的数目。

给你两个整数 <code>x</code> 和 <code>y</code>，计算并返回它们之间的汉明距离。

&nbsp;

示例 1：

<pre>
输入：x = 1, y = 4
输出：2
解释：
1 (0 0 0 1)
4 (0 1 0 0)
 ↑ ↑
上面的箭头指出了对应二进制位不同的位置。
</pre>

示例 2：

<pre>
输入：x = 3, y = 1
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;=&nbsp;x, y &lt;= 231 - 1</code></li>
</ul>

&nbsp;

注意：本题与&nbsp;<a href="https://leetcode.cn/problems/minimum-bit-flips-to-convert-number/">2220. 转换数字的最少位翻转次数</a>&nbsp;相同。