mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"23.5K\", \"totalAcceptedRaw\": 13309, \"totalSubmissionRaw\": 23454, \"acRate\": \"56.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"23.5K\", \"totalAcceptedRaw\": 13314, \"totalSubmissionRaw\": 23461, \"acRate\": \"56.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."
|
||||
|
Reference in New Issue
Block a user