mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,10 +3,10 @@
|
||||
<p><strong>Note</strong> that you must do this in-place without making a copy of the array.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<pre><strong>Input:</strong> nums = [0,1,0,3,12]
|
||||
<strong>Output:</strong> [1,3,12,0,0]
|
||||
</pre><p><strong>Example 2:</strong></p>
|
||||
</pre><p><strong class="example">Example 2:</strong></p>
|
||||
<pre><strong>Input:</strong> nums = [0]
|
||||
<strong>Output:</strong> [0]
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user