mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 08:21:41 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 5854, \"totalSubmissionRaw\": 10338, \"acRate\": \"56.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 5867, \"totalSubmissionRaw\": 10353, \"acRate\": \"56.7%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming: dp(i) will be the answer to the problem for books[i:]."
|
||||
],
|
||||
|
Reference in New Issue
Block a user