1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 11:21:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

This commit is contained in:
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions

View File

@@ -2,7 +2,7 @@
假如整个 `grid` 区域的外侧均为走廊。请问,不与走廊直接相邻的主题空间的最大面积是多少?如果不存在这样的空间请返回 `0`
**示例 1:**
**示例 1**
>输入:`grid = ["110","231","221"]`
>
>输出:`1`
@@ -11,7 +11,7 @@
>![image.png](https://pic.leetcode-cn.com/1613708145-rscctN-image.png)
**示例 2:**
**示例 2**
>输入:`grid = ["11111100000","21243101111","21224101221","11111101111"]`
>
>输出:`3`
@@ -23,5 +23,5 @@
**提示:**
- `1 <= grid.length <= 500`
- `1 <= grid[i].length <= 500`
- `grid[i][j]` 仅可能 `"0""5"`
- `grid[i][j]` 仅可能 `"0""5"`