360. Sort Transformed Array

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

The returned array must be in sorted order.

Expected time complexity: O(n)

Example:

nums = [-4, -2, 2, 4], a = 1, b = 3, c = 5,

Result: [3, 9, 15, 33]

nums = [-4, -2, 2, 4], a = -1, b = 3, c = 5

Result: [-23, -5, 1, 7]

Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.

高中数学学过，二元一次方程如果a>0，曲线两端比中间大，如果a < 0，曲线两端比中间小。从两端向中间遍历，如果a>0，就从右向左填数，如果a<0，就从左向右填数。代码如下：

public class Solution {
    public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
        int res[] = new int[nums.length];
        int i = 0, j = nums.length - 1;
        int index = a >= 0? nums.length - 1: 0;
        while (i <= j) {
            if (a >= 0) {
                res[index --] = mul(nums[i], a, b, c) > mul(nums[j], a, b, c)? mul(nums[i ++], a, b, c): mul(nums[j --], a, b, c);
            } else {
                res[index ++] = mul(nums[i], a, b, c) < mul(nums[j], a, b, c)? mul(nums[i ++], a, b, c): mul(nums[j --], a, b, c);
            }
        }
        return res;
    }
    
    private int mul(int x, int a, int b, int c) {
        return a * x * x + b * x + c;
    }
}