Class Solution
java.lang.Object
g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses.Solution
2086 - Minimum Number of Buckets Required to Collect Rainwater from Houses\.
Medium
You are given a **0-index****ed** string `street`. Each character in `street` is either `'H'` representing a house or `'.'` representing an empty space.
You can place buckets on the **empty spaces** to collect rainwater that falls from the adjacent houses. The rainwater from a house at index `i` is collected if a bucket is placed at index `i - 1` **and/or** index `i + 1`. A single bucket, if placed adjacent to two houses, can collect the rainwater from **both** houses.
Return _the **minimum** number of buckets needed so that for **every** house, there is **at least** one bucket collecting rainwater from it, or_ `-1` _if it is impossible._
**Example 1:**
**Input:** street = "H..H"
**Output:** 2
**Explanation:**
We can put buckets at index 1 and index 2.
"H..H" -> "HBBH" ('B' denotes where a bucket is placed).
The house at index 0 has a bucket to its right, and the house at index 3 has a bucket to its left.
Thus, for every house, there is at least one bucket collecting rainwater from it.
**Example 2:**
**Input:** street = ".H.H."
**Output:** 1
**Explanation:**
We can put a bucket at index 2.
".H.H." -> ".HBH." ('B' denotes where a bucket is placed).
The house at index 1 has a bucket to its right, and the house at index 3 has a bucket to its left.
Thus, for every house, there is at least one bucket collecting rainwater from it.
**Example 3:**
**Input:** street = ".HHH."
**Output:** -1
**Explanation:**
There is no empty space to place a bucket to collect the rainwater from the house at index 2.
Thus, it is impossible to collect the rainwater from all the houses.
**Constraints:**
*
1 <= street.length <= 105
* `street[i]` is either`'H'` or `'.'`.-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minimumBuckets
-