Given an integer array
nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
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].
Input: nums = [-7,-3,2,3,11] Output: [4,9,9,49,121]
1 <= nums.length <= 104
-104 <= nums[i] <= 104
numsis sorted in non-decreasing order.
Follow up: Squaring each element and sorting the new array is very trivial, could you find an
O(n) solution using a different approach?
Find squares of nums and then sorted the squared nums.
class Solution: def sortedSquares(self, nums: List[int]) -> List[int]: squared_nums = [num**2 for num in nums] return list(sorted(squared_nums))
- Time Complexity: O(Nlog(N))
- Space Complexity: O(N)