mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
31 lines
1004 B
HTML
31 lines
1004 B
HTML
<p>Given an integer array <code>nums</code>, reorder it such that <code>nums[0] < nums[1] > nums[2] < nums[3]...</code>.</p>
|
|
|
|
<p>You may assume the input array always has a valid answer.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,5,1,1,6,4]
|
|
<strong>Output:</strong> [1,6,1,5,1,4]
|
|
<strong>Explanation:</strong> [1,4,1,5,1,6] is also accepted.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,3,2,2,3,1]
|
|
<strong>Output:</strong> [2,3,1,3,1,2]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>0 <= nums[i] <= 5000</code></li>
|
|
<li>It is guaranteed that there will be an answer for the given input <code>nums</code>.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<strong>Follow Up:</strong> Can you do it in <code>O(n)</code> time and/or <strong>in-place</strong> with <code>O(1)</code> extra space? |