leetcode/1769.py at main · linlol/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
class Solution:
    def minOperations(self, boxes: str) -> List[int]:
        #sliding window?
        ones = []
        for i,j in enumerate(boxes):
            if j == '1':
                ones.append(i)
        left, right = 0, len(ones) #record the number of balls stay on LHS or equal/ RHS the current position
        ini, ini_val = 0, sum(ones)
        ans = []
        while ini < len(boxes):
            if ini == 0:
                ans.append(ini_val)
            else:
                ini_val += left
                ini_val -= right
                ans.append(ini_val)
            if boxes[ini] == '1':
                left += 1
                right -= 1
            ini += 1
        return ans