!!!题目链接!!!
Solution:
class Solution {
public:
vector<int> sortedSquares(vector<int>& nums) {
vector<int> result(nums.size());
int le = 0;
int ri = nums.size()-1;
int length = nums.size()-1;
while(le <= ri)
{
if(abs(nums[le]) > nums[ri])
{
result[length] = pow(abs(nums[le]),2);
le++;
}else{
result[length] = pow(abs(nums[ri]),2);
ri--;
}
length--;
}
return result;
}
};