1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1215,
"dislikes": 72,
"likes": 1240,
"dislikes": 75,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]]\n4\n[[1,3],[2,4],[3,2]]\n6",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"32K\", \"totalSubmission\": \"55.1K\", \"totalAcceptedRaw\": 32008, \"totalSubmissionRaw\": 55064, \"acRate\": \"58.1%\"}",
"stats": "{\"totalAccepted\": \"32.7K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 32718, \"totalSubmissionRaw\": 56293, \"acRate\": \"58.1%\"}",
"hints": [
"Use dynamic programming: dp(i) will be the answer to the problem for books[i:]."
],