trapping-rain-water[盛水量]

最新推荐文章于 2022-01-25 23:54:30 发布

小白太白

最新推荐文章于 2022-01-25 23:54:30 发布

阅读量144

点赞数

文章标签：算法 leetcode 动态规划数据结构 java

本文链接：https://blog.csdn.net/qq_37194492/article/details/109640351

版权

题目描述

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given[0,1,0,2,1,0,1,3,2,1,2,1], return6.

示例图

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!

思路
求盛下水的总和。
求出序列中最高的值和对应下标，然后分两部分。左边用lMax表示当前最大值，只要低于此值的都可以存水，存水量为lMax-A[i]；当大于lMax时更新其值。右边同理。

import java.util.*;
public class Solution {
    public int trap(int[] A) {
        if(A == null || A.length <= 2)
            return 0;
        
        int index = 0;
        int maxV = A[0];
        for(int i=1; i<A.length; i++){
            if(maxV < A[i]){
                maxV = A[i];
                index = i;
            }
        }
        
        int sum = 0;
        int lMax = A[0];
        for(int i=1; i<index; i++){
            if(lMax < A[i]){
                lMax = A[i];
            }else{
                sum += (lMax - A[i]);
            }
        }
        
        int rMax = A[A.length-1];
        for(int i=A.length-2; i>index; i--){
            if(rMax < A[i]){
                rMax = A[i];
            }else{
                sum += (rMax - A[i]);
            }
        }
        
        return sum;
    }
}