feat: add solutions to lc problem: No.2086 (doocs#867)

No.2086.Minimum Number of Buckets Required to Collect Rainwater from Houses

Author: hongyiheng

solution/2000-2099/2086.Minimum Number of Buckets Required to Collect Rainwater from Houses/README.md

@@ -83,15 +83,52 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minimumBuckets(self, street: str) -> int:
+        n, last = len(street), -2
+        ans = 0
+        for i, v in enumerate(street):
+            if v == 'H':
+                if last == i - 1:
+                    continue
+                if i + 1 < n and street[i + 1] == '.':
+                    last = i + 1
+                elif i - 1 >= 0 and street[i - 1] == '.':
+                    last = i - 1
+                else:
+                    return -1
+                ans += 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int minimumBuckets(String street) {
+        int last = -2, n = street.length();
+        int ans = 0;
+        for (int i = 0; i < n; i++) {
+            char c = street.charAt(i);
+            if (c == 'H') {
+                if (last == i - 1) {
+                    continue;
+                }
+                if (i + 1 < n && street.charAt(i + 1) == '.') {
+                    last = i + 1;
+                } else if (i - 1 >= 0 && street.charAt(i - 1) == '.') {
+                    last = i - 1;
+                } else {
+                    return -1;
+                }
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **...**

solution/2000-2099/2086.Minimum Number of Buckets Required to Collect Rainwater from Houses/README_EN.md

@@ -60,13 +60,50 @@ Thus, it is impossible to collect the rainwater from all the houses.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minimumBuckets(self, street: str) -> int:
+        n, last = len(street), -2
+        ans = 0
+        for i, v in enumerate(street):
+            if v == 'H':
+                if last == i - 1:
+                    continue
+                if i + 1 < n and street[i + 1] == '.':
+                    last = i + 1
+                elif i - 1 >= 0 and street[i - 1] == '.':
+                    last = i - 1
+                else:
+                    return -1
+                ans += 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int minimumBuckets(String street) {
+        int last = -2, n = street.length();
+        int ans = 0;
+        for (int i = 0; i < n; i++) {
+            char c = street.charAt(i);
+            if (c == 'H') {
+                if (last == i - 1) {
+                    continue;
+                }
+                if (i + 1 < n && street.charAt(i + 1) == '.') {
+                    last = i + 1;
+                } else if (i - 1 >= 0 && street.charAt(i - 1) == '.') {
+                    last = i - 1;
+                } else {
+                    return -1;
+                }
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **...**

solution/2000-2099/2086.Minimum Number of Buckets Required to Collect Rainwater from Houses/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int minimumBuckets(String street) {
+        int last = -2, n = street.length();
+        int ans = 0;
+        for (int i = 0; i < n; i++) {
+            char c = street.charAt(i);
+            if (c == 'H') {
+                if (last == i - 1) {
+                    continue;
+                }
+                if (i + 1 < n && street.charAt(i + 1) == '.') {
+                    last = i + 1;
+                } else if (i - 1 >= 0 && street.charAt(i - 1) == '.') {
+                    last = i - 1;
+                } else {
+                    return -1;
+                }
+                ans++;
+            }
+        }
+        return ans;
+    }
+}

solution/2000-2099/2086.Minimum Number of Buckets Required to Collect Rainwater from Houses/Solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def minimumBuckets(self, street: str) -> int:
+        n, last = len(street), -2
+        ans = 0
+        for i, v in enumerate(street):
+            if v == 'H':
+                if last == i - 1:
+                    continue
+                if i + 1 < n and street[i + 1] == '.':
+                    last = i + 1
+                elif i - 1 >= 0 and street[i - 1] == '.':
+                    last = i - 1
+                else:
+                    return -1
+                ans += 1
+        return ans