原题链接

LeetCode

function sortedSquares(nums: number[]): number[] {
    let left = 0, right = nums.length - 1;
    const answer: number[] = [];
    while(left <= right) {
        if(Math.abs(nums[left]) < Math.abs(nums[right])) {
            answer.unshift(nums[right] * nums[right]);
            right--;
        } else {
            answer.unshift(nums[left] * nums[left]);
            left++;
        }
    }

    return answer;
};