-
Notifications
You must be signed in to change notification settings - Fork 61
Expand file tree
/
Copy path2079-watering-plants.js
More file actions
42 lines (39 loc) · 1.42 KB
/
2079-watering-plants.js
File metadata and controls
42 lines (39 loc) · 1.42 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* 2079. Watering Plants
* https://leetcode.com/problems/watering-plants/
* Difficulty: Medium
*
* You want to water n plants in your garden with a watering can. The plants are arranged in
* a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at
* x = i. There is a river at x = -1 that you can refill your watering can at.
*
* Each plant needs a specific amount of water. You will water the plants in the following way:
* - Water the plants in order from left to right.
* - After watering the current plant, if you do not have enough water to completely water the
* next plant, return to the river to fully refill the watering can.
* - You cannot refill the watering can early.
*
* You are initially at the river (i.e., x = -1). It takes one step to move one unit on the x-axis.
*
* Given a 0-indexed integer array plants of n integers, where plants[i] is the amount of water
* the ith plant needs, and an integer capacity representing the watering can capacity, return
* the number of steps needed to water all the plants.
*/
/**
* @param {number[]} plants
* @param {number} capacity
* @return {number}
*/
var wateringPlants = function(plants, capacity) {
let water = capacity;
let result = 0;
for (let i = 0; i < plants.length; i++) {
if (water < plants[i]) {
result += 2 * i;
water = capacity;
}
water -= plants[i];
result++;
}
return result;
};