Trapping Rain Water-Leetcode

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.

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!

Stack中元素的含义是：待求以此高度为底的容器高度，未能遇到右边界。

Java代码：

Stack<Integer> st=new Stack<Integer>();
        int index=0;
        int res=0,cur=0;
        while(index<height.length){
        if(st.empty()||height[st.peek()]>height[index])st.push(index++);
        else{
        int tempt=st.pop();
        cur=st.empty()? 
        0:(index-st.peek()-1)*(Math.min(height[index],height[st.peek()])-height[tempt]);
        res+=cur;
        //System.out.println(cur);
        }
        }
        return res;

}

时间复杂度：O（n）