Leetcode 977

02 Mar 2024 Tech-Post Leetcode

977. Squares of a Sorted Array

Problem Statement :

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]

Constrains :

1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums is sorted in non-decreasing order.

Explanation

- Iterate over the nums till len of nums.
- updated nums[i] by it's square
- return sorted(nums)

Solution (Py3) :

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

Search

    Table of Contents