g2101_2200.s2105_watering_plants_ii.Solution

public class Solution extends Object

2105 - Watering Plants II.Medium Alice and Bob want to water <code>n</code> plants in their garden. The plants are arranged in a row and are labeled from <code>0</code> to <code>n - 1</code> from left to right where the <code>ith</code> plant is located at <code>x = i</code>. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: <ul> <li>Alice waters the plants in order from left to right , starting from the <code>0th</code> plant. Bob waters the plants in order from right to left , starting from the <code>(n - 1)th</code> plant. They begin watering the plants simultaneously.</li> <li>It takes the same amount of time to water each plant regardless of how much water it needs.</li> <li>Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant.</li> <li>In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice should water this plant.</li> </ul> Given a 0-indexed integer array <code>plants</code> of <code>n</code> integers, where <code>plants[i]</code> is the amount of water the <code>ith</code> plant needs, and two integers <code>capacityA</code> and <code>capacityB</code> representing the capacities of Alice’s and Bob’s watering cans respectively, return the number of times they have to refill to water all the plants. Example 1: Input: plants = [2,2,3,3], capacityA = 5, capacityB = 5 Output: 1 Explanation: <ul> <li> Initially, Alice and Bob have 5 units of water each in their watering cans. </li> <li> Alice waters plant 0, Bob waters plant 3. </li> <li> Alice and Bob now have 3 units and 2 units of water respectively. </li> <li> 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. </li> </ul> 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: <ul> <li> Initially, Alice and Bob have 3 units and 4 units of water in their watering cans respectively. </li> <li> Alice waters plant 0, Bob waters plant 3. </li> <li> Alice and Bob now have 1 unit of water each, and need to water plants 1 and 2 respectively. </li> <li> Since neither of them have enough water for their current plants, they refill their cans and then water the plants. </li> </ul> 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: <ul> <li> There is only one plant. </li> <li> 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. </li> </ul> So, the total number of times they have to refill is 0. Constraints: <ul> <li><code>n == plants.length</code></li> <li><code>1 <= n <= 105</code></li> <li><code>1 <= plants[i] <= 106</code></li> <li><code>max(plants[i]) <= capacityA, capacityB <= 109</code></li> </ul>

Constructor Summary

Constructors

Constructor

Description

Solution()
Method Summary

Modifier and Type

Method

Description

int

minimumRefill(int[] plants, int capacityA, int capacityB)

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- Solution
  
  public Solution()
Method Details
- minimumRefill
  
  public int minimumRefill(int[] plants, int capacityA, int capacityB)

Class Solution

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Details

Solution

Method Details

minimumRefill