lichang333 / leetcode_note Goto Github PK

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        sorted_nums = []
        for n in nums:
            sorted_nums.append(n * n)
        return sorted(sorted_nums)
        
#         sorted_nums = [None]*len(nums)
#         i = len(nums) - 1
#         j = 0
#         k = len(nums) - 1
#         while j <= k:
#             if nums[j]**2 >= nums[k]**2:
#                 sorted_nums[i] = nums[j]**2
#                 j += 1
#             else:
#                 sorted_nums[i] = nums[k]**2
#                 k -= 1
#             i -= 1
#         return sorted_nums