LeetCode 977 有序数组平方的排序

 1 class Solution: #等于没做出来，基本上参考的代码随想录的码
 2     def sortedSquares(self, nums: List[int]) -> List[int]:
 3         l = len(nums) - 1
 4         tempNums = [0] * (l + 1)
 5         start = 0
 6         end = l
 7         i = l
 8         while start <= end:
 9             s = nums[start] ** 2
10             e = nums[end] ** 2
11             if s > e:
12                 tempNums[i] = s
13                 start += 1
14             else:
15                 tempNums[i] = e
16                 end -= 1
17             i -= 1
18         return tempNums