coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/solving-questions-with-brainpower.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 510,
"likes": 512,
"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\": \"39K\", \"totalAcceptedRaw\": 17188, \"totalSubmissionRaw\": 38952, \"acRate\": \"44.1%\"}",
"stats": "{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 17248, \"totalSubmissionRaw\": 39054, \"acRate\": \"44.2%\"}",
"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.",