1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51: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": 4519,
"dislikes": 251,
"likes": 4658,
"dislikes": 265,
"isLiked": null,
"similarQuestions": "[{\"title\": \"House Robber\", \"titleSlug\": \"house-robber\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,4,2]\n[2,2,3,3,3,4]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"172K\", \"totalSubmission\": \"300.8K\", \"totalAcceptedRaw\": 171976, \"totalSubmissionRaw\": 300813, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"180.8K\", \"totalSubmission\": \"315.5K\", \"totalAcceptedRaw\": 180807, \"totalSubmissionRaw\": 315477, \"acRate\": \"57.3%\"}",
"hints": [
"If you take a number, you might as well take them all. Keep track of what the value is of the subset of the input with maximum M when you either take or don't take M."
],