单调栈 - wenzhoullq/leetcode GitHub Wiki

    for(int i=0;i<nums.length;i++){
        while(!s.isEmpty()&&nums[s.peek()]比较nums[i]){
              s.pop(); 
              ......
          }
        s.push();
     }

 Stack<Integer> st = new Stack<>();
        st.push(-1);
        int ans = 0;
        for(int i = 0 ; i <= heights.length ;i++ ){
            int h = i <heights.length ? heights[i]:-1;
            while(st.size() > 1 && heights[st.peek()] > h){
                int index = st.pop();
                ans = Math.max(ans,heights[index] * (i - st.peek() - 1));
            }
            st.push(i);
        }
        return ans;