文章作者：Tyan
博客：noahsnail.com ?|? CSDN ?|? 簡(jiǎn)書

1. Description

Squares of a Sorted Array

2. Solution

解析：Version 1，采用雙指針，先計(jì)算平方和，再比較大小，較大的更新到結(jié)果數(shù)組中。Version 2先比較二者絕對(duì)值大小，再將平方更新到結(jié)果中。

• Version 1

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        n = len(nums)
        i = 0
        j = n - 1
        result = [0] * n
        index = n - 1
        x = nums[i] ** 2
        y = nums[j] ** 2
        while i <= j:    
            if x <= y:
                result[index] = y
                index -= 1
                j -= 1
                y = nums[j] ** 2
            else:
                result[index] = x
                index -= 1
                i += 1
                x = nums[i] ** 2
        return result

• Version 2

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        n = len(nums)
        i = 0
        j = n - 1
        result = [0] * n
        index = n - 1
        while i <= j: 
            x = nums[i]
            y = nums[j]
            if abs(x) <= abs(y):
                result[index] = y * y
                index -= 1
                j -= 1
                y = nums[j]
            else:
                result[index] = x * x
                index -= 1
                i += 1
                x = nums[i]
        return result

Reference

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