{% tabs %} {% tab title="O(n)" %}
class Solution:
def sortedSquares(self, A: List[int]) -> List[int]:
n = len(A)
ans = [0] * n
i, j, idx = 0, n - 1, n - 1
while i <= j: ## 必须等于
if A[i] * A[i] > A[j] * A[j]:
ans[pos] = A[i] * A[i]
i += 1
else:
ans[pos] = A[j] * A[j]
j -= 1
pos -= 1
return ans
{% endtab %}
{% tab title="Python" %}
class Solution:
def sortedSquares(self, A: List[int]) -> List[int]:
A = list(map(lambda x : x ** 2 , A))
A.sort()
return A
{% endtab %} {% endtabs %}