comefrom: <awangdev>Maximal Rectangle_1.java
code: private int findLargestRectInHistogram(int[] height) {
  
          Stack<Integer> stack = new Stack<>();
          int m = height.length;
          int max = 0;
          for (int i = 0; i <= m; i++) {
              int currHeight = i == m ? -1 : height[i];
              while (!stack.isEmpty() && currHeight <= height[stack.peek()]) {
                  int peekHeight = height[stack.pop()];
                  int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                  max = Math.max(max, peekHeight * width);
              }
              stack.push(i);
          }
          return max;
      }
masked: private int sample_funcname ( int [ ] var_0 ) {
    Stack < Integer > var_1 = new Stack < > ( ) ;
    int var_2 = var_0 . length ;
    int max = 0 ;
    for ( int var_3 = 0 ;
    var_3 <= var_2 ;
    var_3 ++ ) {
      int var_4 = var_3 == var_2 ? - 1 : var_0 [ var_3 ] ;
      while ( ! var_1 . isEmpty ( ) && var_4 <= var_0 [ var_1 . peek ( ) ] ) {
        int var_5 = var_0 [ var_1 . pop ( ) ] ;
        int var_6 = var_1 . isEmpty ( ) ? var_3 : var_3 - var_1 . peek ( ) - 1 ;
        max = Math . max ( max , var_5 * var_6 ) ;
      }
      var_1 . push ( var_3 ) ;
    }
    return max ;
  }
  