[LeetCode] Maximal Square 最大正方形

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

For example, given the following matrix:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Return 4.

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

参考资料：

https://leetcode.com/discuss/38485/my-concise-solution-in-c

https://leetcode.com/discuss/38489/easy-solution-with-detailed-explanations-8ms-time-and-space

http://www.5uzh.com/view.aspx?kn=50037263

[LeetCode] Maximal Square 最大正方形

原文：http://www.cnblogs.com/grandyang/p/4550604.html