Squares of a Sorted Array

LeetCode

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

Example 1:

  • 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].

Example 2:

  • Input: nums = [-7,-3,2,3,11]
  • Output: [4,9,9,49,121]
1def sortedSquares(nums: List[int]) -> List[int]:
2    n = len(nums)
3    res = [0] * n
4    l, r = 0, n - 1
5    
6    for i in range(n - 1, -1, -1):
7        if abs(nums[l]) > abs(nums[r]):
8            res[i] = nums[l] ** 2
9            l += 1
10        else:
11            res[i] = nums[r] ** 2
12            r -= 1
13            
14    return res
Previous
Container With Most Water
Next
Interval List Intersections
l
-4
0
-1
1
0
2
3
3
r
10
4
res=[0, 0, 0, 0, 0]
Step 1 / 6
Step 1:
Initialize pointers l=0, r=4. Output array res of size 5.
Pointers: l=0, r=4
Focus: select @ [0, 4]