https://leetcode.cn/problems/squares-of-a-sorted-array/description/
思路
双指针,一个从头往后一个从后忘前,新申请一个vector存放排序后的值
code
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int low = 0;
int high = nums.size()-1;
vector<int> res(high+1);
int pos = high;
while(low<=high){
if(nums[low]*nums[low]<=nums[high]*nums[high]) res[pos--]=nums[high]*nums[high--];
if(nums[low]*nums[low]>nums[high]*nums[high]) res[pos--]=nums[low]*nums[low++];
}
return res;
}
};