Package g0201_0300.s0221_maximal_square
Class Solution
java.lang.Object
g0201_0300.s0221_maximal_square.Solution
221 - Maximal Square.<p>Medium</p>
<p>Given an <code>m x n</code> binary <code>matrix</code> filled with <code>0</code>’s and <code>1</code>’s, <em>find the largest square containing only</em> <code>1</code>’s <em>and return its area</em>.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/11/26/max1grid.jpg" alt="" /></p>
<p><strong>Input:</strong> matrix = [[“1”,“0”,“1”,“0”,“0”],[“1”,“0”,“1”,“1”,“1”],[“1”,“1”,“1”,“1”,“1”],[“1”,“0”,“0”,“1”,“0”]]</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/11/26/max2grid.jpg" alt="" /></p>
<p><strong>Input:</strong> matrix = [[“0”,“1”],[“1”,“0”]]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> matrix = [[“0”]]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>m == matrix.length</code></li>
<li><code>n == matrix[i].length</code></li>
<li><code>1 <= m, n <= 300</code></li>
<li><code>matrix[i][j]</code> is <code>'0'</code> or <code>'1'</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
maximalSquare
public int maximalSquare(char[][] matrix)
-