Skip to content

feat: add solutions to lc problem: No.0360 #4737

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 21, 2025
Merged

feat: add solutions to lc problem: No.0360 #4737

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
237 changes: 154 additions & 83 deletions solution/0300-0399/0360.Sort Transformed Array/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,13 @@ tags:

<!-- solution:start -->

### 方法一
### 方法一：数学 + 双指针

根据数学知识可知，二次函数的图像是一条抛物线，当 $a \gt 0$ 时，抛物线开口向上，顶点为最小值；当 $a \lt 0$ 时，抛物线开口向下，顶点为最大值。

由于数组 $\textit{nums}$ 已经排好序，我们可以使用双指针分别指向数组的两端，根据 $a$ 的正负决定从结果数组的头部还是尾部开始填充较大（或较小）的值。

时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 是数组 $\textit{nums}$ 的长度。

<!-- tabs:start -->

Expand All @@ -68,31 +74,29 @@ class Solution:
def sortTransformedArray(
self, nums: List[int], a: int, b: int, c: int
) -> List[int]:
def f(x):
def f(x: int) -> int:
return a * x * x + b * x + c

n = len(nums)
i, j, k = 0, n - 1, 0 if a < 0 else n - 1
res = [0] * n
while i <= j:
v1, v2 = f(nums[i]), f(nums[j])
if a < 0:
if v1 <= v2:
res[k] = v1
i, j = 0, n - 1
ans = [0] * n
for k in range(n):
y1, y2 = f(nums[i]), f(nums[j])
if a > 0:
if y1 > y2:
ans[n - k - 1] = y1
i += 1
else:
res[k] = v2
ans[n - k - 1] = y2
j -= 1
k += 1
else:
if v1 >= v2:
res[k] = v1
i += 1
else:
res[k] = v2
if y1 > y2:
ans[k] = y2
j -= 1
k -= 1
return res
else:
ans[k] = y1
i += 1
return ans
```

#### Java
Expand All @@ -101,35 +105,33 @@ class Solution:
class Solution {
public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
int n = nums.length;
int i = 0, j = n - 1, k = a < 0 ? 0 : n - 1;
int[] res = new int[n];
while (i <= j) {
int v1 = f(a, b, c, nums[i]), v2 = f(a, b, c, nums[j]);
if (a < 0) {
if (v1 <= v2) {
res[k] = v1;
++i;
int[] ans = new int[n];
int i = 0, j = n - 1;

IntUnaryOperator f = x -> a * x * x + b * x + c;

for (int k = 0; k < n; k++) {
int y1 = f.applyAsInt(nums[i]);
int y2 = f.applyAsInt(nums[j]);
if (a > 0) {
if (y1 > y2) {
ans[n - k - 1] = y1;
i++;
} else {
res[k] = v2;
--j;
ans[n - k - 1] = y2;
j--;
}
++k;
} else {
if (v1 >= v2) {
res[k] = v1;
++i;
if (y1 > y2) {
ans[k] = y2;
j--;
} else {
res[k] = v2;
--j;
ans[k] = y1;
i++;
}
--k;
}
}
return res;
}

private int f(int a, int b, int c, int x) {
return a * x * x + b * x + c;
return ans;
}
}
```
Expand All @@ -141,35 +143,35 @@ class Solution {
public:
vector<int> sortTransformedArray(vector<int>& nums, int a, int b, int c) {
int n = nums.size();
int i = 0, j = n - 1, k = a < 0 ? 0 : n - 1;
vector<int> res(n);
while (i <= j) {
int v1 = f(a, b, c, nums[i]), v2 = f(a, b, c, nums[j]);
if (a < 0) {
if (v1 <= v2) {
res[k] = v1;
++i;
vector<int> ans(n);
int i = 0, j = n - 1;

auto f = [&](int x) {
return a * x * x + b * x + c;
};

for (int k = 0; k < n; k++) {
int y1 = f(nums[i]);
int y2 = f(nums[j]);
if (a > 0) {
if (y1 > y2) {
ans[n - k - 1] = y1;
i++;
} else {
res[k] = v2;
--j;
ans[n - k - 1] = y2;
j--;
}
++k;
} else {
if (v1 >= v2) {
res[k] = v1;
++i;
if (y1 > y2) {
ans[k] = y2;
j--;
} else {
res[k] = v2;
--j;
ans[k] = y1;
i++;
}
--k;
}
}
return res;
}

int f(int a, int b, int c, int x) {
return a * x * x + b * x + c;
return ans;
}
};
```
Expand All @@ -178,42 +180,111 @@ public:

```go
func sortTransformedArray(nums []int, a int, b int, c int) []int {
n := len(nums)
i, j, k := 0, n-1, 0
if a >= 0 {
k = n - 1
f := func(x int) int {
return a*x*x + b*x + c
}
res := make([]int, n)
for i <= j {
v1, v2 := f(a, b, c, nums[i]), f(a, b, c, nums[j])
if a < 0 {
if v1 <= v2 {
res[k] = v1

n := len(nums)
ans := make([]int, n)
i, j := 0, n-1

for k := 0; k < n; k++ {
y1, y2 := f(nums[i]), f(nums[j])
if a > 0 {
if y1 > y2 {
ans[n-k-1] = y1
i++
} else {
res[k] = v2
ans[n-k-1] = y2
j--
}
k++
} else {
if v1 >= v2 {
res[k] = v1
i++
} else {
res[k] = v2
if y1 > y2 {
ans[k] = y2
j--
} else {
ans[k] = y1
i++
}
k--
}
}
return res
return ans
}
```

func f(a, b, c, x int) int {
return a*x*x + b*x + c
#### TypeScript

```ts
function sortTransformedArray(nums: number[], a: number, b: number, c: number): number[] {
const f = (x: number): number => a * x * x + b * x + c;
const n = nums.length;
let [i, j] = [0, n - 1];
const ans: number[] = Array(n);
for (let k = 0; k < n; ++k) {
const y1 = f(nums[i]);
const y2 = f(nums[j]);
if (a > 0) {
if (y1 > y2) {
ans[n - k - 1] = y1;
++i;
} else {
ans[n - k - 1] = y2;
--j;
}
} else {
if (y1 > y2) {
ans[k] = y2;
--j;
} else {
ans[k] = y1;
++i;
}
}
}
return ans;
}
```

#### JavaScript

```js
/**
* @param {number[]} nums
* @param {number} a
* @param {number} b
* @param {number} c
* @return {number[]}
*/
var sortTransformedArray = function (nums, a, b, c) {
const f = x => a * x * x + b * x + c;
const n = nums.length;
let [i, j] = [0, n - 1];
const ans = Array(n);
for (let k = 0; k < n; ++k) {
const y1 = f(nums[i]);
const y2 = f(nums[j]);
if (a > 0) {
if (y1 > y2) {
ans[n - k - 1] = y1;
++i;
} else {
ans[n - k - 1] = y2;
--j;
}
} else {
if (y1 > y2) {
ans[k] = y2;
--j;
} else {
ans[k] = y1;
++i;
}
}
}
return ans;
};
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
Loading