Leetcode - Squares of a Sorted Array

https://leetcode.com/problems/squares-of-a-sorted-array/

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

Example 1:

Input: [-4,-1,0,3,10]
Output: [0,1,9,16,100]

func sortedSquares(A []int) []int {
    result := make([]int, len(A))
    start := 0
    for start < len(A) && A[start] < 0 {
        start++
    }
    left := start - 1
    right := start
    index := 0
    for left >= 0 && right < len(A) {
        leftSquare := A[left] * A[left]
        rightSquare := A[right] * A[right]
        if leftSquare < rightSquare {
            result[index] = leftSquare
            left--
        } else {
            result[index] = rightSquare
            right++
        }
        index++
    }
    for left >= 0 {
        result[index] = A[left] * A[left]
        index++
        left--
    }
    for right < len(A) {
        result[index] = A[right] * A[right]
        index++
        right++
    }
    return result
}

• 相关文章
• 全局相关文章