> For the complete documentation index, see [llms.txt](https://nataliekung.gitbook.io/ladder_code/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nataliekung.gitbook.io/ladder_code/qiang-hua-4-shuang-zhi-zhen-ff09/sort-transformed-array.md).

# Sort Transformed Array

Given a**sorted**array 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 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]
```

**Example 2:**

```
Input: 
nums = 
[-4,-2,2,4]
, a = 
-1
, b = 
3
, c = 
5
Output: 
[-23,-5,1,7]
```

分析

就是map函数映射，记得用lambda

```
class Solution:
    def sortTransformedArray(self, nums: List[int], a: int, b: int, c: int) -> List[int]:

        nl = map(lambda x: a*x**2 + b*x+c, nums)
        return sorted(nl)
```