【Leetcode】Maximal Rectangle (DP)

Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.

这道题是Largest Rectangle in Hist和dynamic programming的结合，是一道非常综合的题目。做这道题之前先把Largest Rectangle in Hist做熟悉，这道题就很简单了，因为把每一行横切过去都可以看成是一个直方图的题。然后用动态规划来计算高度，就可以了

看代码貌似比看解释容易，所以.......

直接上代码

	public int maximalRectangle(char[][] matrix) {
		if (matrix == null || matrix.length == 0 || matrix[0].length == 0)
			return 0;

		int maxArea = 0;
		int height[] = new int[matrix[0].length];
		for (int i = 0; i < matrix.length; i++) {
			for (int j = 0; j < matrix[0].length; j++) {
				height[j] = matrix[i][j] == '0' ? 0 : (height[j] + 1);
			}
			maxArea = Math.max(maxArea, largestRectangleArea(height));
		}
		return maxArea;
	}

	public static int largestRectangleArea(int[] height) {
		if (height == null || height.length == 0)
			return 0;
		ArrayList<Integer> newHeight = new ArrayList<Integer>();
		for (int i = 0; i < height.length; i++)
			newHeight.add(height[i]);
		newHeight.add(0);

		LinkedList<Integer> stack = new LinkedList<Integer>();
		int maxArea = 0;
		int i = 0;

		while (i < newHeight.size()) {
			if (stack.isEmpty()
					|| newHeight.get(stack.peek()) < newHeight.get(i))
				stack.push(i++);
			else {
				int top = stack.pop();
				int width = stack.isEmpty() ? i : i - stack.peek() - 1;
				maxArea = Math.max(maxArea, newHeight.get(top) * width);
			}
		}
		return maxArea;
	}