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

6
leetcode/originData/[no content]shortest-path-in-a-hidden-grid.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 110,
"dislikes": 44,
"likes": 112,
"dislikes": 45,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Robot Room Cleaner\", \"titleSlug\": \"robot-room-cleaner\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Path Cost in a Hidden Grid\", \"titleSlug\": \"minimum-path-cost-in-a-hidden-grid\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,2],[-1,0]]\n[[0,0,-1],[1,1,1],[2,0,0]]\n[[-1,0],[0,2]]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 3780, \"totalSubmissionRaw\": 9115, \"acRate\": \"41.5%\"}",
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"9.4K\", \"totalAcceptedRaw\": 3882, \"totalSubmissionRaw\": 9394, \"acRate\": \"41.3%\"}",
"hints": [
"The grid is at a maximum 500 x 500, so it is clever to assume that the robot's initial cell is grid[501][501]",
"Run a DFS from the robot's position to make sure that you can reach the target, otherwise you should return -1.",