题目链接:. - 力扣(LeetCode)
代码:
class Solution {
public int[] sortedSquares(int[] nums) {
int[] res = new int[nums.length];
int left = 0, right = nums.length - 1;
int k=right;
while (left <= right) {
// l<r ;
if(Math.abs(nums[left]) <= Math.abs(nums[right])) {
res[k--]=nums[right]*nums[right--];
}
else {
res[k--]=nums[left]*nums[left++];
}
if(left==right){
res[k--]=nums[right]*nums[right];
break;
}
}
return res;
}
}