Skip to content

Latest commit

 

History

History

0221.maximal-square

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

题目

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 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.

解题思路

[解题报告] LeetCode 221. Maximal Square