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 360 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 360 # by problem number
lcpy gen -s sort_transformed_array # by problem name
nums and three integers a, b and c, apply a quadratic function of the form f(x) = ax^2 + bx + c to each element nums[i] in the array, and return the array in a sorted order.
Input: nums = [-4,-2,2,4], a = 1, b = 3, c = 5
Output: [3,9,15,33]
Input: nums = [-4,-2,2,4], a = -1, b = 3, c = 5
Output: [-23,-5,1,7]
1 <= nums.length <= 200-100 <= nums[i], a, b, c <= 100nums is sorted in ascending order.O(n) time?
class Solution:
# Time: O(n)
# Space: O(n)
def sort_transformed_array(self, nums: list[int], a: int, b: int, c: int) -> list[int]:
n = len(nums)
result: list[int] = [0] * n
def f(x: int) -> int:
return a * x * x + b * x + c
i, j = 0, n - 1
idx = n - 1 if a >= 0 else 0
while i <= j:
left, right = f(nums[i]), f(nums[j])
if a >= 0:
if left >= right:
result[idx] = left
i += 1
else:
result[idx] = right
j -= 1
idx -= 1
else:
if left <= right:
result[idx] = left
i += 1
else:
result[idx] = right
j -= 1
idx += 1
return result
| Time | Space |
|---|---|
| O(n) | O(n) |