squares-of-a-sorted-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code> sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

&nbsp;
Example 1:

<pre>
Input: nums = [-4,-1,0,3,10]
Output: [0,1,9,16,100]
Explanation: After squaring, the array becomes [16,1,0,9,100].
After sorting, it becomes [0,1,9,16,100].
</pre>

Example 2:

<pre>
Input: nums = [-7,-3,2,3,11]
Output: [4,9,9,49,121]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> is sorted in non-decreasing order.</li>
</ul>

&nbsp;
Follow up: Squaring each element and sorting the new array is very trivial, could you find an <code>O(n)</code> solution using a different approach?

sortedSquares

Squares of a Sorted Array

Merge Sorted Array

merge-sorted-array

合并两个有序数组

Sort Transformed Array

sort-transformed-array

有序转化数组

Array

Two Pointers

Sorting

给你一个按 非递减顺序 排序的整数数组 <code>nums</code>，返回 每个数字的平方 组成的新数组，要求也按 非递减顺序 排序。

<ul>
</ul>

&nbsp;

示例 1：

<pre>
输入：nums = [-4,-1,0,3,10]
输出：[0,1,9,16,100]
解释：平方后，数组变为 [16,1,0,9,100]
排序后，数组变为 [0,1,9,16,100]</pre>

示例 2：

<pre>
输入：nums = [-7,-3,2,3,11]
输出：[4,9,9,49,121]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> 已按 非递减顺序 排序</li>
</ul>

&nbsp;

进阶：

<ul>
	<li>请你设计时间复杂度为 <code>O(n)</code> 的算法解决本问题</li>
</ul>