lym199286的专栏

class Solution {public: int trap(int A[], int n) { int top=0; if(n<3) return 0; s[top++]=0; int res=0,t=0,pre=0; for(int i=1;i<n;i++) {

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o