mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
18 lines
569 B
HTML
18 lines
569 B
HTML
|
<p>Given an array of integers <code>nums</code>, sort the array in ascending order.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [5,2,3,1]
|
||
|
|
<strong>Output:</strong> [1,2,3,5]
|
||
|
|
</pre><p><strong>Example 2:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [5,1,1,2,0,0]
|
||
|
|
<strong>Output:</strong> [0,0,1,1,2,5]
|
||
|
|
</pre>
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</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>
|