algo-aha

倒水往低流

• https://leetcode.com/problems/pour-water/

vector<int> pourWater(vector<int>& heights, int V, int K) {
    // 模拟倒水，先尽量往左边低地流、再尽量往右边低地流
    const int N = heights.size();
    while (V--) {
        int low = K;
        for (int i = K; i > 0 && heights[i-1] <= heights[i]; i--) { // <=的地儿都要查
            if (heights[i-1] < heights[i]) low = i-1;
        }
        if (low == K) { // 没往左边流，再尝试往右流
            for (int i = K; i < N - 1 && heights[i+1] <= heights[i]; i++) {
                if (heights[i+1] < heights[i]) low = i+1;
            }
        }
        heights[low]++;
    }
    return heights;
}