mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 06:22:54 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"10.5K\", \"totalAcceptedRaw\": 6251, \"totalSubmissionRaw\": 10473, \"acRate\": \"59.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 6307, \"totalSubmissionRaw\": 10579, \"acRate\": \"59.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."
|
||||
|
Reference in New Issue
Block a user