coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]minimum-path-cost-in-a-hidden-grid.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 51,
"dislikes": 17,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Robot Room Cleaner\", \"titleSlug\": \"robot-room-cleaner\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Shortest Path in a Hidden Grid\", \"titleSlug\": \"shortest-path-in-a-hidden-grid\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[2,3],[1,1]]\n0\n1\n1\n0\n[[0,3,1],[3,4,2],[1,2,0]]\n2\n0\n0\n2\n[[1,0],[0,1]]\n0\n0\n1\n1",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1754, \"totalSubmissionRaw\": 3277, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 1805, \"totalSubmissionRaw\": 3374, \"acRate\": \"53.5%\"}",
"hints": [
"The grid is at a maximum 100 x 100, so it is clever to assume that the robot's initial cell is grid[101][101]",
"Run a DFS from the robot's position to make sure that you can reach the target, otherwise you should return -1.",