forked from doocs / leetcode

加入 Gitee

与超过 1200万开发者一起发现、参与优秀开源项目，私有仓库也完全免费：）

克隆/下载

README_EN.md 1.60 KB

# [17.23. Max Black Square](https://leetcode-cn.com/problems/max-black-square-lcci)

[中文文档](/lcci/17.23.Max%20Black%20Square/README.md)

## Description

<p>Imagine you have a square matrix, where each cell (pixel) is either black or white Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.</p>

<p>Return an array&nbsp;<code>[r, c, size]</code>, where&nbsp;<code>r</code>,&nbsp;<code>c</code>&nbsp;are the row number and the column number of the subsquare&#39;s upper left corner respectively, and <code>size</code>&nbsp;is the side length of the subsquare. If there are more than one answers, return the one that has smallest <code>r</code>. If there are more than one answers that have the same <code>r</code>, return the one that has smallest <code>c</code>. If there&#39;s no answer, return an empty array.</p>

<p><strong>Example 1:</strong></p>

<pre>

<strong>Input:

</strong>[

&nbsp;  [1,0,1],

&nbsp;  [<strong>0,0</strong>,1],

&nbsp;  [<strong>0,0</strong>,1]

]

<strong>Output: </strong>[1,0,2]

<strong>Explanation:</strong> 0 represents black, and 1 represents white, bold elements in the input is the answer.

</pre>

<p><strong>Example 2:</strong></p>

<pre>

<strong>Input:

</strong>[

&nbsp;  [<strong>0</strong>,1,1],

&nbsp;  [1,0,1],

&nbsp;  [1,1,0]

]

<strong>Output: </strong>[0,0,1]

</pre>

<p><strong>Note: </strong></p>

<ul>
	<li><code>matrix.length == matrix[0].length &lt;= 200</code></li>
</ul>

## Solutions

### **Python3**

```python

```

### **Java**

```java

```

### **...**

```

```

一键复制编辑原始数据按行查看历史

提交于 2020-10-20 11:19 . docs: prettify code

17.23. Max Black Square

Description

Imagine you have a square matrix, where each cell (pixel) is either black or white Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.

Return an array [r, c, size], where r, c are the row number and the column number of the subsquare's upper left corner respectively, and size is the side length of the subsquare. If there are more than one answers, return the one that has smallest r. If there are more than one answers that have the same r, return the one that has smallest c. If there's no answer, return an empty array.

Example 1:


Input:

[

   [1,0,1],

   [0,0,1],

   [0,0,1]

]

Output: [1,0,2]

Explanation: 0 represents black, and 1 represents white, bold elements in the input is the answer.

Example 2:


Input:

[

   [0,1,1],

   [1,0,1],

   [1,1,0]

]

Output: [0,0,1]

Note:

matrix.length == matrix[0].length <= 200

Solutions

Python3

Java

...

Java

1

https://gitee.com/keshuimao/leetcode.git

git@gitee.com:keshuimao/leetcode.git

keshuimao

leetcode

leetcode

main