Time: 156 ms (59.70%), Space: 18.5 MB (93.14%) - LeetHub

Author: hogan-tech

0977-squares-of-a-sorted-array/0977-squares-of-a-sorted-array.py

@@ -1,10 +1,12 @@
+# time complexity: O(nlogn)
+# space complexity: O(1)
 from typing import List
 
 
 class Solution:
     def sortedSquares(self, nums: List[int]) -> List[int]:
         for i in range(len(nums)):
-            nums[i] = nums[i] ** 2    
+            nums[i] = nums[i] ** 2
         return sorted(nums)