coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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\": \"1.8K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1750, \"totalSubmissionRaw\": 3272, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1754, \"totalSubmissionRaw\": 3277, \"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.",