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-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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 344,
"dislikes": 16,
"likes": 355,
"dislikes": 19,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,3,6,8,4]\n1\n3\n5\n[4,3,1]\n1\n0\n6\n[5,2,1]\n0\n2\n3",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"16.7K\", \"totalAcceptedRaw\": 9597, \"totalSubmissionRaw\": 16672, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 9817, \"totalSubmissionRaw\": 17050, \"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."