755PourWater.py

class Solution:
    def pourWater(self, heights: List[int], V: int, K: int) -> List[int]:
        for _ in range(V):
            flag = 0
            for d in (-1, 1):
                i = best = K
                while 0 <= i+d < len(heights) and heights[i+d] <= heights[i]:
                    if heights[i+d] < heights[i]: best = i+d
                    i += d
                if best != K:
                    heights[best] += 1
                    flag = 1
                    break
            # 每一滴水，如果左右都不能下降，则在K处++
            if flag == 0:
                heights[K] += 1
        return heights