![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/cbe5e77a0585dda105b35f7f2f5ffa19.png)
暴力解:
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
for(int i = 0; i < nums.size(); i++){
nums[i] = nums[i]*nums[i];
}
sort(nums.begin(),nums.end());
return nums;
}
};
双指针:
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
int k = nums.size()-1;
vector<int>res(nums.size(),0);
int i = 0, j = nums.size()-1;
while(i <= j){
if(nums[i]*nums[i] > nums[j]*nums[j]){
res[k--] = nums[i]*nums[i];
i++;
}else{
res[k--] = nums[j]*nums[j];
j--;
}
}
return res;
}
};