coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
leetcode-cn/problem (Chinese)/汉明距离 [hamming-distance].html
View File

@@ -2,7 +2,7 @@
<p>给你两个整数 <code>x</code> 和 <code>y</code>，计算并返回它们之间的汉明距离。</p>
<p> </p>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
@@ -23,10 +23,14 @@
<strong>输出：</strong>1
</pre>
<p> </p>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>0 <= x, y <= 2<sup>31</sup> - 1</code></li>
<li><code>0 &lt;=&nbsp;x, y &lt;= 2<sup>31</sup> - 1</code></li>
</ul>
<p>&nbsp;</p>
<p><strong>注意：</strong>本题与&nbsp;<a href="https://leetcode.cn/problems/minimum-bit-flips-to-convert-number/">2220. 转换数字的最少位翻转次数</a>&nbsp;相同。</p>