solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/Solution.py at main

main

leetcode-ion

388 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.py

4 Complexity
4 Complexity / M
0 Duplication
1 Churn
13 Lines
13 Lines of Code
1 Methods
13 LOC / Method

class Solution:
    def minSwaps(self, nums: List[int]) -> int:
        cnt = nums.count(1)
        n = len(nums)
        s = [0] * ((n << 1) + 1)
        for i in range(n << 1):
            s[i + 1] = s[i] + nums[i % n]
        mx = 0
        for i in range(n << 1):
            j = i + cnt - 1
            if j < (n << 1):
                mx = max(mx, s[j + 1] - s[i])
        return cnt - mx