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,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 512,
"likes": 539,
"dislikes": 7,
"isLiked": null,
"similarQuestions": "[{\"title\": \"House Robber\", \"titleSlug\": \"house-robber\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Frog Jump\", \"titleSlug\": \"frog-jump\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 17248, \"totalSubmissionRaw\": 39054, \"acRate\": \"44.2%\"}",
"stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 17920, \"totalSubmissionRaw\": 40358, \"acRate\": \"44.4%\"}",
"hints": [
"For each question, we can either solve it or skip it. How can we use Dynamic Programming to decide the most optimal option for each problem?",
"We store for each question the maximum points we can earn if we started the exam on that question.",