1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "某解密游戏中,有一个 N\\*M 的迷宫,迷宫地形会随时间变化而改变,迷宫出口一直位于 `(n-1,m-1)` 位置。迷宫变化规律记录于 `maze` 中,`maze[i]` 表示 `i` 时刻迷宫的地形状态,`\".\"` 表示可通行空地,`\"#\"` 表示陷阱。\n\n地形图初始状态记作 `maze[0]`,此时小力位于起点 `(0,0)`。此后每一时刻可选择往上、下、左、右其一方向走一步,或者停留在原地。\n\n小力背包有以下两个魔法卷轴卷轴使用一次后消失\n+ 临时消除术:将指定位置在下一个时刻变为空地;\n+ 永久消除术:将指定位置永久变为空地。\n\n请判断在迷宫变化结束前含最后时刻小力能否在不经过任意陷阱的情况下到达迷宫出口呢\n\n**注意: 输入数据保证起点和终点在所有时刻均为空地。**\n\n**示例 1**\n>输入:`maze = [[\".#.\",\"#..\"],[\"...\",\".#.\"],[\".##\",\".#.\"],[\"..#\",\".#.\"]]`\n>\n>输出:`true`\n>\n>解释:\n![maze.gif](https://pic.leetcode-cn.com/1615892239-SCIjyf-maze.gif)\n\n\n**示例 2**\n>输入:`maze = [[\".#.\",\"...\"],[\"...\",\"...\"]]`\n>\n>输出:`false`\n>\n>解释:由于时间不够,小力无法到达终点逃出迷宫。\n\n**示例 3**\n>输入:`maze = [[\"...\",\"...\",\"...\"],[\".##\",\"###\",\"##.\"],[\".##\",\"###\",\"##.\"],[\".##\",\"###\",\"##.\"],[\".##\",\"###\",\"##.\"],[\".##\",\"###\",\"##.\"],[\".##\",\"###\",\"##.\"]]`\n>\n>输出:`false`\n>\n>解释:由于道路不通,小力无法到达终点逃出迷宫。\n\n**提示:**\n- `1 <= maze.length <= 100`\n- `1 <= maze[i].length, maze[i][j].length <= 50`\n- `maze[i][j]` 仅包含 `\".\"`、`\"#\"`",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 27,
"likes": 28,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 2153, \"totalSubmissionRaw\": 7935, \"acRate\": \"27.1%\"}",
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 2331, \"totalSubmissionRaw\": 8266, \"acRate\": \"28.2%\"}",
"hints": [],
"solution": null,
"status": null,