LeetCode977.Squares of a Sorted Array

最新推荐文章于 2025-09-04 16:11:29 发布

weixin_30685047

最新推荐文章于 2025-09-04 16:11:29 发布

阅读量113

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/peerless1024/p/10836631.html

本文提供LeetCode上编号为977的题目“有序数组的平方”的解决方案。该题要求对给定的非递减有序整数数组，返回每个元素的平方，并保持非递减顺序。示例输入[-4,-1,0,3,10]，正确输出[0,1,9,16,100]。文章详细解析了算法思路并附带Go语言实现代码。

题目

977. 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]

Example 2:

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

Note:

1 <= A.length <= 10000
-10000 <= A[i] <= 10000
A is sorted in non-decreasing order.

答案

func sortedSquares(A []int) []int {
    size := len(A)
    res := make([]int, size)
    for l, r, i := 0, size-1, size-1; l <= r; i-- {
        if A[l]+A[r] < 0 {
            res[i] = A[l] * A[l]
            l++
        } else {
            res[i] = A[r] * A[r]
            r--
        }
    }
    return res
}