leetcode/lc/2105/

[giscus[bot]]

leetcode/lc/2105/

多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解

https://doocs.github.io/leetcode/lc/2105/

[lazyJLBL]

嘿嘿，我来简单的优化一下，把else里面的东西放到外面去，可以少写几行代码，芜湖

class Solution:
    def minimumRefill(self, plants: List[int], capacityA: int, capacityB: int) -> int:
        l,r = 0,len(plants) - 1
        water1,water2 = capacityA,capacityB
        ans = 0
        while l < r:
            if plants[l] > water1:
                ans += 1
                water1 = capacityA
            water1 -= plants[l]
            l += 1
            if plants[r] > water2:
                ans += 1
                water2 = capacityB
            water2 -= plants[r]
            r -= 1
            if l == r and max(water1,water2) < plants[l]:
                ans += 1
        return ans

[lazyJLBL]

直接少写两个else

[yanglbme]

谢谢反馈哈，我重新完善了题解，已经提交到 GitHub，晚点网站会自动更新