mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
30 lines
598 B
HTML
30 lines
598 B
HTML
|
<p>给你一个整数数组 <code>nums</code>,请你将该数组升序排列。</p>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<ol>
|
|||
|
</ol>
|
|||
|
|
|||
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>nums = [5,2,3,1]
|
|||
|
<strong>输出:</strong>[1,2,3,5]
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>nums = [5,1,1,2,0,0]
|
|||
|
<strong>输出:</strong>[0,0,1,1,2,5]
|
|||
|
</pre>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>提示:</strong></p>
|
|||
|
|
|||
|
<ul>
|
|||
|
<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>
|
|||
|
<li><code>-5 * 10<sup>4</sup> <= nums[i] <= 5 * 10<sup>4</sup></code></li>
|
|||
|
</ul>
|