https://leetcode.cn/problems/watering-plants

README.md

@@ -152,6 +152,8 @@ go get github.com/masx200/leetcode-test
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/watering-plants
+
 https://leetcode.cn/problems/kth-ancestor-of-a-tree-node
 
 https://leetcode.cn/problems/counter-ii/

watering-plants/index.ts

@@ -0,0 +1,15 @@
+function wateringPlants(plants: number[], capacity: number): number {
+    let ans = 0;
+    let rest = capacity;
+    for (let i = 0; i < plants.length; i++) {
+        if (rest >= plants[i]) {
+            ans++;
+            rest -= plants[i];
+        } else {
+            ans += i * 2 + 1;
+            rest = capacity - plants[i];
+        }
+    }
+    return ans;
+}
+export default wateringPlants;