You want to water $n$ plants in a row, indexed from $0$ to $n - 1$ from left to right. The plant at index $i$ is situated at coordinate $i$ and needs plants[i] units of water. You are given an integer array plants and an integer capacity representing the maximum capacity of your watering can.

You start at the river located at coordinate $-1$ with a full watering can. You must water the plants according to the following rules:

Water the plants in order from left to right, starting at plant $0$ and ending at plant $n - 1$.
Moving between adjacent coordinates takes $1$ step.
If your watering can contains enough water to fully water plant $i$, move to coordinate $i$ and water it.
If your watering can does not have enough water to fully water plant $i$, return to the river at coordinate $-1$ to fully refill the can, then walk to coordinate $i$ to water it.
You cannot refill your watering can unless you cannot completely water the current plant.

Return the total number of steps required to water all the plants.

Constraints:

• n == plants.length

• $1 \leq$ n $\leq 1000$

• $1 \leq$ plants[i] $\leq 10^6$

• $\max($plants[i]$) \leq$ capacity $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.