再见小小ronnie的博客

/** * Scan row by row. * Calculate the histogram for each row. e.g. for row 2 the histogram is 2, 0, 2, 1, 1 * Calculate the largest area of this histogram. */ public class Solution { public

Using two stacks, one to save elements, and the other to save the minimum. Therefore, there is a mapping between an element and current minimum.          stack                   min          -1

/** * Basic idea is using a stack to record the ascending heights in the given array. * Every time meet a height that is smaller than the previous one, pop out the statck, find the maximum area from