[leetCode] 977. Squares of a Sorted Array

🎆 Description

Given an integer array nums sorted in non-decreasing order,
eturn an array of the squares of each number sorted in non-decreasing order.

Example 1:

Input: nums = [-4,-1,0,3,10]
Output: [0,1,9,16,100]
Explanation: After squaring, the array becomes [16,1,0,9,100].
After sorting, it becomes [0,1,9,16,100].
Example 2:

Input: nums = [-7,-3,2,3,11]
Output: [4,9,9,49,121]

🎇 Solution

var sortedSquares = function(nums) {
    let low = 0;
    let high = nums.length - 1;
    let output = [];
    
    while(low <= high) {
        if (nums[low]**2 > nums[high]**2) {
            output.push(nums[low]**2);
            low++;
        } else {
            output.push(nums[high]**2);
            high--;
        }
    }
    return output.reverse();
};

two pointers

どうして降順に腕立て伏せして反転しますか()