1
class Solution:
2
    def minimumRefill(self, plants: List[int], capacityA: int, capacityB: int) -> int:
3
        ans = 0
4
        lo, hi = 0, len(plants) - 1
5
        canA, canB = capacityA, capacityB
6
        while lo < hi:
7
            if canA < plants[lo]:
8
                ans += 1
9
                canA = capacityA
10
            canA -= plants[lo]
11
            if canB < plants[hi]:
12
                ans += 1
13
                canB = capacityB
14
            canB -= plants[hi]
15
            lo, hi = lo + 1, hi - 1
16
        if lo == hi and max(canA, canB) < plants[lo]:
17
            ans += 1
18
        return ans