mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
15
算法题(国内版)/problem (Chinese)/交换数字 [swap-numbers-lcci].html
Normal file
15
算法题(国内版)/problem (Chinese)/交换数字 [swap-numbers-lcci].html
Normal file
@@ -0,0 +1,15 @@
|
||||
<p>编写一个函数,不用临时变量,直接交换<code>numbers = [a, b]</code>中<code>a</code>与<code>b</code>的值。</p>
|
||||
|
||||
<p><strong>示例:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong> numbers = [1,2]
|
||||
<strong>输出:</strong> [2,1]
|
||||
</pre>
|
||||
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>numbers.length == 2</code></li>
|
||||
<li><code>-2147483647 <= numbers[i] <= 2147483647</code></li>
|
||||
</ul>
|
Reference in New Issue
Block a user