coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/count-all-possible-routes.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"55.7K\", \"totalSubmission\": \"84.8K\", \"totalAcceptedRaw\": 55742, \"totalSubmissionRaw\": 84829, \"acRate\": \"65.7%\"}",
"stats": "{\"totalAccepted\": \"55.7K\", \"totalSubmission\": \"84.8K\", \"totalAcceptedRaw\": 55748, \"totalSubmissionRaw\": 84844, \"acRate\": \"65.7%\"}",
"hints": [
"Use dynamic programming to solve this problem with each state defined by the city index and fuel left.",
"Since the array contains distinct integers fuel will always be spent in each move and so there can be no cycles."