mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
21
算法题(国内版)/problem (Chinese)/配对交换 [exchange-lcci].html
Normal file
21
算法题(国内版)/problem (Chinese)/配对交换 [exchange-lcci].html
Normal file
@@ -0,0 +1,21 @@
|
||||
<p>配对交换。编写程序,交换某个整数的奇数位和偶数位,尽量使用较少的指令(也就是说,位0与位1交换,位2与位3交换,以此类推)。</p>
|
||||
|
||||
<p> <strong>示例1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:num = 2(或者0b10)
|
||||
<strong> 输出</strong> 1 (或者 0b01)
|
||||
</pre>
|
||||
|
||||
<p> <strong>示例2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:num = 3
|
||||
<strong> 输出</strong>:3
|
||||
</pre>
|
||||
|
||||
<p> <strong>提示:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li><code>num</code>的范围在[0, 2^30 - 1]之间,不会发生整数溢出。</li>
|
||||
</ol>
|
Reference in New Issue
Block a user