mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 05:26:46 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 5989, \"totalSubmissionRaw\": 14646, \"acRate\": \"40.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 6012, \"totalSubmissionRaw\": 14689, \"acRate\": \"40.9%\"}",
|
||||
"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