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], return 6.

解題思路：

先找到第一塊最高的木板，然后從前向最高木板遍歷，接著從后向最高木板遍歷，JAVA實現如下：

static public int trap(int[] height) {int result=0,peak=0,firstMax=0;for(int i=0;i<height.length;i++)if(height[i]>height[firstMax])firstMax=i;for(int i=0;i<firstMax;i++)if(height[i]>height[peak])peak=i;else result+=height[peak]-height[i];peak=height.length-1;for(int i=height.length-1;i>firstMax;i--)if(height[i]>height[peak])peak=i;else result+=height[peak]-height[i];return result;}

?

轉載于:https://www.cnblogs.com/tonyluis/p/4496051.html

總結

以上是生活随笔為你收集整理的Java for LeetCode 042 Trapping Rain Water的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。