Sync LeetCode submission Runtime - 155 ms (54.12%), Memory - 19 MB (10.92%)

Author: jimit105

1019-squares-of-a-sorted-array/solution.py

@@ -1,17 +1,22 @@
+# Approach 2: Two Pointer
+
+# Time: O(N)
+# Space: O(N)
+
 class Solution:
     def sortedSquares(self, nums: List[int]) -> List[int]:
         n = len(nums)
-        left, right = 0, n-1
         result = [0] * n
-        
-        for i in range(n-1, -1, -1):
+        left, right = 0, n - 1
+
+        for i in range(n - 1, -1, -1):
             if abs(nums[left]) < abs(nums[right]):
                 square = nums[right]
                 right -= 1
             else:
                 square = nums[left]
                 left += 1
-            result[i] = square ** 2
-            
+            result[i] = square * square
+
         return result