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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-the-safest-path-in-a-grid.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 4344, \"totalSubmissionRaw\": 15533, \"acRate\": \"28.0%\"}",
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 4346, \"totalSubmissionRaw\": 15538, \"acRate\": \"28.0%\"}",
"hints": [
"Consider using both BFS and binary search together.",
"Launch a BFS starting from all the cells containing thieves to calculate d[x][y] which is the smallest Manhattan distance from (x, y) to the nearest grid that contains thieves.",