add 2086

fishercoder1534 · fishercoder1534 · commit bb21e485601f · 2021-11-27T08:07:59.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2086|[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) ||Medium||
 |2085|[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) ||Easy||
 |2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) ||Medium|Array, Binary Search|
 |2079|[Watering Plants](https://leetcode.com/problems/watering-plants/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2086.java b/src/main/java/com/fishercoder/solutions/_2086.java
@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+public class _2086 {
+    public static class Solution1 {
+        public int minimumBuckets(String street) {
+            int minBuckets = 0;
+            int[] buckets = new int[street.length()];
+            for (int i = 0; i < street.length(); i++) {
+                if (street.charAt(i) == 'H') {
+                    if (i + 1 < street.length() && street.charAt(i + 1) == '.') {
+                        if (i - 1 >= 0 && buckets[i - 1] == 1) {
+                            continue;
+                        }
+                        buckets[i + 1] = 1;
+                        minBuckets++;
+                    } else if (i + 1 < street.length() && street.charAt(i + 1) == 'H') {
+                        if (i - 1 < 0) {
+                            return -1;
+                        } else if (i - 1 >= 0 && street.charAt(i - 1) == 'H') {
+                            return -1;
+                        } else {
+                            if (buckets[i - 1] == 1) {
+                                continue;
+                            } else {
+                                buckets[i - 1] = 1;
+                                minBuckets++;
+                            }
+                        }
+                    } else if (i + 1 >= street.length() && i - 1 < 0) {
+                        return -1;
+                    } else if (i - 1 >= 0 && street.charAt(i - 1) == '.') {
+                        if (buckets[i - 1] == 1) {
+                            continue;
+                        } else {
+                            minBuckets++;
+                            buckets[i - 1] = 1;
+                        }
+                    } else if (i + 1 >= street.length() && i - 1 >= 0 && street.charAt(i - 1) == 'H') {
+                        return -1;
+                    }
+                }
+            }
+            return minBuckets;
+        }
+    }
+}
