Java for Leetcode 042 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 .

Problem Solving Ideas:

Find the first tallest plank first, then traverse from the front to the highest plank, then traverse from the back to the highest plank, the Java implementation is as follows:

    static public int Trap (int[] height) {    int result=0,peak=0,firstmax=0;    for (int i=0;i
Java for Leetcode 042 trapping Rain water