mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
30 lines
1.1 KiB
HTML
30 lines
1.1 KiB
HTML
<p>Given an integer array <code>nums</code> sorted in <strong>non-decreasing</strong> order, return <em>an array of <strong>the squares of each number</strong> sorted in non-decreasing order</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-4,-1,0,3,10]
|
|
<strong>Output:</strong> [0,1,9,16,100]
|
|
<strong>Explanation:</strong> After squaring, the array becomes [16,1,0,9,100].
|
|
After sorting, it becomes [0,1,9,16,100].
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-7,-3,2,3,11]
|
|
<strong>Output:</strong> [4,9,9,49,121]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code><span>1 <= nums.length <= </span>10<sup>4</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
|
|
<li><code>nums</code> is sorted in <strong>non-decreasing</strong> order.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<strong>Follow up:</strong> Squaring each element and sorting the new array is very trivial, could you find an <code>O(n)</code> solution using a different approach? |