2079. Watering Plants

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public int wateringPlants(int[] plants, int capacity) {
int steps = 0, water = capacity;

for (int i = 0; i < plants.length; i++) {
int plant = plants[i];
if (water < plant) {
// 需要回到河里加水
steps += i * 2;
water = capacity;
}

steps++;
water -= plant;
}

return steps;
}
}

References

2079. Watering Plants