add 2079

fishercoder1534 · fishercoder1534 · commit 4366dd677aa3 · 2021-11-21T08:14:19.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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2079|[Watering Plants](https://leetcode.com/problems/watering-plants/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) ||Medium||
 |2078|[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) ||Easy||
 |2076|[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) ||Hard||
 |2075|[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2075.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2079.java b/src/main/java/com/fishercoder/solutions/_2079.java
@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+public class _2079 {
+    public static class Solution1 {
+        public int wateringPlants(int[] plants, int capacity) {
+            int steps = 0;
+            int remainder = capacity;
+            for (int i = 0; i < plants.length; i++) {
+                if (plants[i] > remainder) {
+                    steps += i * 2;
+                    steps++;
+                    remainder = capacity - plants[i];
+                } else {
+                    remainder -= plants[i];
+                    steps++;
+                }
+            }
+            return steps;
+        }
+    }
+}
