coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-13 01:15:14 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
leetcode-cn/problem (Chinese)/最大黑方阵 [max-black-square-lcci].html
View File

@@ -2,27 +2,29 @@
<p>返回一个数组 <code>[r, c, size]</code> ，其中&nbsp;<code>r</code>,&nbsp;<code>c</code>&nbsp;分别代表子方阵左上角的行号和列号，<code>size</code> 是子方阵的边长。若有多个满足条件的子方阵，返回 <code>r</code> 最小的，若 <code>r</code> 相同，返回 <code>c</code> 最小的子方阵。若无满足条件的子方阵，返回空数组。</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:
<pre>
<strong>输入：
</strong>[
&nbsp; [1,0,1],
&nbsp; [<strong>0,0</strong>,1],
&nbsp; [<strong>0,0</strong>,1]
]
<strong>输出: </strong>[1,0,2]
<strong>解释: </strong>输入中 0 代表黑色，1 代表白色，标粗的元素即为满足条件的最大子方阵
<strong>输出：</strong>[1,0,2]
<strong>解释：</strong>输入中 0 代表黑色，1 代表白色，标粗的元素即为满足条件的最大子方阵
</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre><strong>输入:
<pre>
<strong>输入：
</strong>[
&nbsp; [<strong>0</strong>,1,1],
&nbsp; [1,0,1],
&nbsp; [1,1,0]
]
<strong>输出: </strong>[0,0,1]
<strong>输出：</strong>[0,0,1]
</pre>
<p><strong>提示：</strong></p>