mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 12122, \"totalSubmissionRaw\": 27219, \"acRate\": \"44.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 12125, \"totalSubmissionRaw\": 27225, \"acRate\": \"44.5%\"}",
|
||||
"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.",
|
||||
|
Reference in New Issue
Block a user