题目
解题代码
class Solution {public int wateringPlants(int[] plants, int capacity) {int cur = -1; //当前位置int step = 0; //走的步数int ca = capacity; //初始化容量for(int i = 0; i < plants.length; i++ ) {if( ca >= plants[i]) { //容量够,去下一格子浇水step += 1; //步数更新,实际也可加一cur = i; //更新当前位置ca -= plants[i]; //更新容量} else {step += 2 * (cur + 1) + 1; //回河边取水再去下一个位置浇水cur = i; //更新当前位置ca = capacity - plants[i]; //更新去下一个格子浇水后的容量}}return step;}}

