Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.7 MB (83.24%)

Author: jimit105

0075-sort-colors/solution.py

@@ -1,7 +1,24 @@
+# Approach 1: One Pass
+
+# Time: O(n)
+# Space: O(1)
+
 class Solution:
     def sortColors(self, nums: List[int]) -> None:
         """
         Do not return anything, modify nums in-place instead.
         """
-        nums.sort()
+        p0 = curr = 0
+        p2 = len(nums) - 1
+
+        while curr <= p2:
+            if nums[curr] == 0:
+                nums[p0], nums[curr] = nums[curr], nums[p0]
+                p0 += 1
+                curr += 1
+            elif nums[curr] == 2:
+                nums[curr], nums[p2] = nums[p2], nums[curr]
+                p2 -= 1
+            else:
+                curr += 1