0977-squares-of-a-sorted-array.java

class Solution {

    public int[] sortedSquares(int[] nums) {

        int[] result = new int[nums.length];

        int right = nums.length - 1;
        int left = 0;
        int resultIndex = result.length - 1;
        while (left <= right) {

            if (nums[left] * nums[left] >= nums[right] * nums[right]) {
                result[resultIndex] = nums[left] * nums[left];
                left++;
            } else {
                result[resultIndex] = nums[right] * nums[right];
                right--;
            }
            resultIndex--;
        }

        return result;
    }
}