前置条件:非递减数组
- 暴力排序法
for i in range(len(nums):
nums[i] *= nums[i]
sorted(nums)
- 双指针法
left,right = 0,len(nums) - 1
ans = [0] * len(nums)
pos = len(nums) - 1
while left <= right:
if nums[left] * nums[left] > nums[right] * nums[right]:
ans[pos] = nums[left] * nums[left]
left += 1
else:
ans[pos] = nums[right] * nums[right]
right -= 1
pos -= 1