Leetcode - 977. Squares of a Sorted Array

Leetcode - 977. Squares of a Sorted Array

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

Solution

func sortedSquares(nums []int) []int {
    ln := len(nums)
    sortedSquared := make([]int, ln)
    highestIndex := ln-1
    
    left, right := 0, ln-1

    for left<=right{
        squaredLeft := nums[left]*nums[left]
        squaredRight := nums[right]*nums[right]

        if squaredLeft>squaredRight{
            sortedSquared[highestIndex] = squaredLeft
            highestIndex--
            left++
        }else{
            sortedSquared[highestIndex] = squaredRight
            highestIndex--
            right--
        }
    }
    return sortedSquared
}