Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0201_0300.s0221_maximal_square.Solution

```
public class Solution
extends Object
```
221 - Maximal Square.
Medium

Given an m x n binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.

Example 1:

Input: matrix = [[“1”,“0”,“1”,“0”,“0”],[“1”,“0”,“1”,“1”,“1”],[“1”,“1”,“1”,“1”,“1”],[“1”,“0”,“0”,“1”,“0”]]

Output: 4

Example 2:

Input: matrix = [[“0”,“1”],[“1”,“0”]]

Output: 1

Example 3:

Input: matrix = [[“0”]]

Output: 0

Constraints:
- m == matrix.length
- n == matrix[i].length
- 1 <= m, n <= 300
- matrix[i][j] is '0' or '1'.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int maximalSquare(char[][] matrix)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

maximalSquare

public int maximalSquare(char[][] matrix)