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

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

@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"265\", \"totalSubmission\": \"430\", \"totalAcceptedRaw\": 265, \"totalSubmissionRaw\": 430, \"acRate\": \"61.6%\"}",
"stats": "{\"totalAccepted\": \"289\", \"totalSubmission\": \"465\", \"totalAcceptedRaw\": 289, \"totalSubmissionRaw\": 465, \"acRate\": \"62.2%\"}",
"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.",