coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

4
leetcode/originData/count-all-possible-routes.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 343,
"likes": 344,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 9569, \"totalSubmissionRaw\": 16630, \"acRate\": \"57.5%\"}",
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"16.7K\", \"totalAcceptedRaw\": 9597, \"totalSubmissionRaw\": 16672, \"acRate\": \"57.6%\"}",
"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."