Maximal Rectangle

 

几个神奇的题目都是用这种 O（n）的算法出来的， 核心思想就是，“比我好的都算了”

Largest Rectangle in Histogram

 

Longest Valid Parentheses 

Maximal Rectangle

ref

http://blog.csdn.net/linhuanmars/article/details/24444491

http://www.cnblogs.com/springfor/p/3869492.html

http://www.cnblogs.com/lichen782/p/leetcode_Largest_Rectangle_in_Histogram.html

public class Solution {
    public int maximalRectangle(char[][] matrix) {
        // http://www.cnblogs.com/springfor/p/3869492.html
        // http://blog.csdn.net/linhuanmars/article/details/24444491
        if(matrix ==null || matrix.length==0 || matrix[0].length==0) return 0;
        int m = matrix.length;
        int n = matrix[0].length;
        int [] h = new int [n];
        int res = 0;
        
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(matrix[i][j]=='0') {
                    h[j]=0;
                }else{
                    h[j] +=1;
                }
            }
            res = Math.max(res, LR(h));
        }
        
        return res;
        
    }
    
    public int LR(int[] height){ //https://leetcode.com/problems/largest-rectangle-in-histogram/
        int res = 0, i=0;
        int[] h = new int[height.length+1];
        h = Arrays.copyOf(height, height.length+1);
        Stack<Integer> st = new Stack<Integer>();
        
        while(i<h.length){
            if(st.isEmpty()||h[st.peek()]<=h[i]){
                st.push(i++);          // must increase i here!
            }else{
                int t = st.pop();
                res = Math.max(res, h[t]*(st.isEmpty()? i : i-st.peek()-1));
            }
        }
        return res;
    }
}