mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1214,
|
||||
"likes": 1215,
|
||||
"dislikes": 72,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"32K\", \"totalSubmission\": \"55K\", \"totalAcceptedRaw\": 31958, \"totalSubmissionRaw\": 54992, \"acRate\": \"58.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"32K\", \"totalSubmission\": \"55.1K\", \"totalAcceptedRaw\": 32008, \"totalSubmissionRaw\": 55064, \"acRate\": \"58.1%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming: dp(i) will be the answer to the problem for books[i:]."
|
||||
],
|
||||
|
Reference in New Issue
Block a user