mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 5638, \"totalSubmissionRaw\": 21378, \"acRate\": \"26.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 5639, \"totalSubmissionRaw\": 21381, \"acRate\": \"26.4%\"}",
|
||||
"hints": [
|
||||
"Notice that an ideal array is non-decreasing.",
|
||||
"Consider an alternative problem: where an ideal array must also be strictly increasing. Can you use DP to solve it?",
|
||||
|
Reference in New Issue
Block a user