Leetcode. Squares of a Sorted Array

Problem:

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

 

Example 1:

Input: [-4,-1,0,3,10]

Output: [0,1,9,16,100]

 

Example 2:

Input: [-7,-3,2,3,11]

Output: [4,9,9,49,121]

 

-Summary-

Squares of each element in Array, then sort them using sort() function.

class Solution:
    def sortedSquares(self, A: List[int]) -> List[int]:
        for i in range(len(A)):
            A[i] = A[i] * A[i]
            
        A.sort()
            
        return A

Here is simply one line code from the leetcode solution as well.

class Solution(object):
    def sortedSquares(self, A):
        return sorted(x*x for x in A)

Complexity Analysis

• Time Complexity: O(NlogN), where N is the length of A

• Space Complexity: O(1), O(N) for leetcode solution

모든 문제에 대한 저작권은 LeetCode 회사에 있습니다. [Copyright © 2020 LeetCode]