Runtime: 2744 ms (Top 5.27%) | Memory: 18.7 MB (Top 12.22%)

Author: AnasImloul

scripts/algorithms/M/Minimum Swaps to Group All 1s Together II/Minimum Swaps to Group All 1's Together II.py

@@ -0,0 +1,14 @@
+# Runtime: 2744 ms (Top 5.27%) | Memory: 18.7 MB (Top 12.22%)
+class Solution:
+    def minSwaps(self, nums: List[int]) -> int:
+        width = sum(num == 1 for num in nums) #width of the window
+        nums += nums
+        res = width
+        curr_zeros = sum(num == 0 for num in nums[:width]) #the first window is nums[:width]
+
+        for i in range(width, len(nums)):
+            curr_zeros -= (nums[i - width] == 0) #remove the leftmost 0 if exists
+            curr_zeros += (nums[i] == 0) #add the rightmost 0 if exists
+            res = min(res, curr_zeros) #update if needed
+
+        return res