Leetcode--trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar are 1, compute how much WA ter It is the able to trap after raining.

For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1] , return 6 .

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 the Rain Water (blue section) is being trapped. Thanks Marcos for contributing this image!

Title: Given n non-negative integers represent a width chart, the width of each small lattice is 1, calculating how much rain it can save after the rain.

Original title Link: https://oj.leetcode.com/problems/trapping-rain-water/

Analysis: Similar to the cask principle, the water it can store depends on one of the highest left-most and highest-right compartments in a range. So first find the highest point, less than the highest point of the left and right points, to preserve the water between the left and right to the highest point.

public static int Trap (int[] A) {int len = a.length;if (len <= 2) return 0;int higest = A[0],high_index = 0;for (int i=0;i& lt;len;i++) {int tmp = A[I];IF (Higest < tmp) {higest = A[i];high_index = i;}}  int sum = 0;int Maxl = A[0],MAXR = a[len-1];for (int i=0;i



Leetcode--trapping Rain Water