mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 03:11:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -0,0 +1,21 @@
|
||||
<p>Write a function to determine the number of bits you would need to flip to convert integer A to integer B.</p>
|
||||
|
||||
<p><strong>Example1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> Input</strong>: A = 29 (0b11101), B = 15 (0b01111)
|
||||
<strong> Output</strong>: 2
|
||||
</pre>
|
||||
|
||||
<p><strong>Example2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> Input</strong>: A = 1,B = 2
|
||||
<strong> Output</strong>: 2
|
||||
</pre>
|
||||
|
||||
<p><strong>Note:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li><code>-2147483648 <= A, B <= 2147483647</code></li>
|
||||
</ol>
|
Reference in New Issue
Block a user