coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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

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

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 708,
"dislikes": 75,
"dislikes": 77,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Path With Minimum Effort\", \"titleSlug\": \"path-with-minimum-effort\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,0,0],[0,0,0],[0,0,1]]\n[[0,0,1],[0,0,0],[0,0,0]]\n[[0,0,0,1],[0,0,0,0],[0,0,0,0],[1,0,0,0]]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.3K\", \"totalSubmission\": \"53.2K\", \"totalAcceptedRaw\": 16317, \"totalSubmissionRaw\": 53188, \"acRate\": \"30.7%\"}",
"stats": "{\"totalAccepted\": \"16.3K\", \"totalSubmission\": \"53.2K\", \"totalAcceptedRaw\": 16320, \"totalSubmissionRaw\": 53214, \"acRate\": \"30.7%\"}",
"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.",