MCPcopy Create free account
hub / github.com/aylei/leetcode-rust / Solution

Class Solution

src/solution/s0221_maximal_square.rs:19–19  ·  view source on GitHub ↗

* [221] Maximal Square * * Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. * * Example: * * * Input: * * 1 0 1 0 0 * 1 0 1 1 1 * 1 1 1 1 1 * 1 0 0 1 0 * * Output: 4 * */

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected