Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 977 with 14 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 977 # by problem number
lcpy gen -s squares_of_a_sorted_array # by problem name
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 <= 10^4-10^4 <= nums[i] <= 10^4nums is sorted in non-decreasing order.O(n) solution using a different approach?
class Solution:
# Time: O(n)
# Space: O(n)
def sorted_squares(self, nums: list[int]) -> list[int]:
result: list[int] = [0] * len(nums)
left, right = 0, len(nums) - 1
index = len(nums) - 1
while left <= right:
if abs(nums[left]) > abs(nums[right]):
result[index] = nums[left] * nums[left]
left += 1
else:
result[index] = nums[right] * nums[right]
right -= 1
index -= 1
return result
| Time | Space |
|---|---|
| O(n) | O(n) |