Leetcode - Sort Transformed Array

Given a sorted array of integers nums and integer values a, b and c. Apply a quadratic function of the form f(x) = ax² + bx + c to each element x in the array.

The returned array must be in sorted order.

Expected time complexity: O(n)

Example 1:

Input: nums = [-4,-2,2,4], a = 1, b = 3, c = 5
Output: [3,9,15,33]

func sortTransformedArray(nums []int, a int, b int, c int) []int {
    result := make([]int, len(nums))
    right := len(nums)-1
    left := 0
    index := len(nums)-1
    for left <= right {
        leftVal := a*nums[left]*nums[left] + b*nums[left] + c
        rightVal := a*nums[right]*nums[right] + b*nums[right] + c
        if leftVal > rightVal{
            result[index] = leftVal
            left++
        } else {
            result[index] = rightVal
            right--
        }
        index--
    }
    if a < 0 {
        sort.Ints(result)
    }
    
    return result
}

• 相关文章
• 全局相关文章