Sort Transformed Array
Given asortedarray of integersnumsand integer valuesa,bandc. Apply a quadratic function of the form f(x) =ax2+bx+cto each elementxin the array.
The returned array must be insorted 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]
Example 2:
Input: nums = [-4,-2,2,4], a = -1, b = 3, c = 5
Output: [-23,-5,1,7]
Solution
class Solution {
public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
}
}
Last updated
Was this helpful?