mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,10 +3,10 @@
|
||||
<p>You must do this by modifying the input array <a href="https://en.wikipedia.org/wiki/In-place_algorithm" target="_blank">in-place</a> with <code>O(1)</code> extra memory.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<pre><strong>Input:</strong> s = ["h","e","l","l","o"]
|
||||
<strong>Output:</strong> ["o","l","l","e","h"]
|
||||
</pre><p><strong>Example 2:</strong></p>
|
||||
</pre><p><strong class="example">Example 2:</strong></p>
|
||||
<pre><strong>Input:</strong> s = ["H","a","n","n","a","h"]
|
||||
<strong>Output:</strong> ["h","a","n","n","a","H"]
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user