coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/originData/[no content]minimum-path-cost-in-a-hidden-grid.json
View File

@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 2696, \"totalSubmissionRaw\": 4891, \"acRate\": \"55.1%\"}",
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 2697, \"totalSubmissionRaw\": 4893, \"acRate\": \"55.1%\"}",
"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.",