-
Notifications
You must be signed in to change notification settings - Fork 3
/
360.cpp
39 lines (37 loc) · 1.12 KB
/
360.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution {
public:
int function(int x, int a, int b, int c) {
return a * x * x + b * x + c;
}
vector<int> sortTransformedArray(vector<int>& nums, int a, int b, int c) {
if (a == 0) {
if (b < 0) {
reverse(nums.begin(), nums.end());
}
for (int i = 0; i < nums.size(); ++i) {
nums[i] = function(nums[i], a, b, c);
}
return nums;
}
double middle = static_cast<double>(-b) / (2 * a);
int n = nums.size();
int left = 0;
int right = nums.size() - 1;
vector<int> res;
while (left <= right) {
if (abs(middle - (double)nums[left]) > abs((double)nums[right] - middle)) {
res.push_back(nums[left]);
left++;
}
else {
res.push_back(nums[right]);
right--;
}
}
for (int i = 0; i < res.size(); ++i) {
res[i] = function(res[i], a, b, c);
}
if (a > 0) reverse(res.begin(), res.end());
return res;
}
};