integers, where plants[i] is the amount of water the ith plant needs, and two integers capacityA and capacityB representing the capacities of Alice's and Bob's watering cans respectively, return thenumber of times they have to refill to water all the plants.

Examples

Example 1

Input: plants = [2,2,3,3], capacityA = 5, capacityB = 5
Output: 1
Explanation:
- Initially, Alice and Bob have 5 units of water each in their watering cans.
- Alice waters plant 0, Bob waters plant 3.
- Alice and Bob now have 3 units and 2 units of water respectively.
- Alice has enough water for plant 1, so she waters it. Bob does not have enough water for plant 2, so he refills his can then waters it.
So, the total number of times they have to refill to water all the plants is 0 + 0 + 1 + 0 = 1.

Example 2

Input: plants = [2,2,3,3], capacityA = 3, capacityB = 4
Output: 2
Explanation:
- Initially, Alice and Bob have 3 units and 4 units of water in their watering cans respectively.
- Alice waters plant 0, Bob waters plant 3.
- Alice and Bob now have 1 unit of water each, and need to water plants 1 and 2 respectively.
- Since neither of them have enough water for their current plants, they refill their cans and then water the plants.
So, the total number of times they have to refill to water all the plants is 0 + 1 + 1 + 0 = 2.

Example 3

Input: plants = [5], capacityA = 10, capacityB = 8
Output: 0
Explanation:
- There is only one plant.
- Alice's watering can has 10 units of water, whereas Bob's can has 8 units. Since Alice has more water in her can, she waters this plant.
So, the total number of times they have to refill is 0.

Constraints

n == plants.length
1 <= n <= 10^5
1 <= plants[i] <= 10^6
max(plants[i]) <= capacityA, capacityB <= 10^9

Solution

Method 1 – Two Pointers Simulation

Intuition

Use two pointers: one for Alice (left to right), one for Bob (right to left). Simulate the process, refilling as needed. If both meet at the same plant, the one with more water waters it (Alice if equal).

Approach

Initialize two pointers, i (Alice) at 0 and j (Bob) at n-1. Track current water for both. For each step:

If i < j, Alice waters i, Bob waters j.
If i == j, only one waters (the one with more water, Alice if equal).
For each, if not enough water, refill and count. Continue until all plants are watered.

Code

[{"language":"Python","code":"from typing import List\nclass Solution:\n    def minimumRefill(self, plants: List[int], capacityA: int, capacityB: int) -> int:\n        i, j = 0, len(plants) - 1\n        a, b = capacityA, capacityB\n        refills = 0\n        while i < j:\n            if a < plants[i]:\n                refills += 1\n                a = capacityA\n            a -= plants[i]\n            if b < plants[j]:\n                refills += 1\n                b = capacityB\n            b -= plants[j]\n            i += 1\n            j -= 1\n        if i == j:\n            if max(a, b) < plants[i]:\n                refills += 1\n        return refills","lang":"python"},{"language":"Java","code":"class Solution {\n    public int minimumRefill(int[] plants, int capacityA, int capacityB) {\n        int i = 0, j = plants.length - 1;\n        int a = capacityA, b = capacityB, refills = 0;\n        while (i < j) {\n            if (a < plants[i]) {\n                refills++;\n                a = capacityA;\n            }\n            a -= plants[i++];\n            if (b < plants[j]) {\n                refills

Related Tags