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]
Ouput : [0,1,9,16,100]
Explaniation : 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 <= 10^4
-10^4 <= nums[i] <= 10^4
nums
is sorted in non-decreasing order.Follow up : Squaring each element and sorting the new arrya is trivial, could you find an O(n) solution using a different approach?
numpy 라이브러리를 사용해보자.
import numpy as np
class Solution(object):
def sortedSquares(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
return np.sort(np.power(nums,2))
numpy 라이브러리에서 제공해주는 메서드에 대해서 좀 더 공부해보자.