mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -0,0 +1,21 @@
|
||||
<p>整数转换。编写一个函数,确定需要改变几个位才能将整数A转成整数B。</p>
|
||||
|
||||
<p> <strong>示例1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:A = 29 (或者0b11101), B = 15(或者0b01111)
|
||||
<strong> 输出</strong>:2
|
||||
</pre>
|
||||
|
||||
<p> <strong>示例2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:A = 1,B = 2
|
||||
<strong> 输出</strong>:2
|
||||
</pre>
|
||||
|
||||
<p> <strong>提示:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li>A,B范围在[-2147483648, 2147483647]之间</li>
|
||||
</ol>
|
Reference in New Issue
Block a user