leetcode[977]Squares of a Sorted Array Python3实现（双指针，类似归并排序merge）

# Given an array of integers A sorted in non-decreasing order, return an array o
# f 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. 
#  
#  
#  Related Topics 数组 双指针 
#  👍 132 👎 0


# leetcode submit region begin(Prohibit modification and deletion)
class Solution:
    def sortedSquares(self, A: List[int]) -> List[int]:
        s = [i**2 for i in A]
        l, r = 0, len(A)-1
        i = r
        while i > 0:
            if s[l] >= s[r]:
                A[i] = s[l]
                l += 1
            else:
                A[i] = s[r]
                r -= 1
            i -= 1
        A[0] = s[l]
        return A
# leetcode submit region end(Prohibit modification and deletion)

对A的元素平方后，得到一个抛物线，两边高，中间低。用双指针指向最左和最右，取二者中较大的倒序放入待返回数组中即可，类似归并排序的merge操作。

对数组每个元素进行操作也可以用map函数。map()函数接收两个参数，一个是函数，一个是Iterable，map将传入的函数依次作用到序列的每个元素，并把结果作为新的Iterator返回，Iterator是惰性序列，因此还需通过list()函数让它把整个序列都计算出来并返回一个list。

s = list(map(lambda x: x * x, A))

参考：python map/reduce