coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/steps-to-make-array-non-decreasing.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 6536, \"totalSubmissionRaw\": 29624, \"acRate\": \"22.1%\"}",
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 6538, \"totalSubmissionRaw\": 29633, \"acRate\": \"22.1%\"}",
"hints": [
"Notice that an element will be removed if and only if there exists a strictly greater element to the left of it in the array.",
"For each element, we need to find the number of rounds it will take for it to be removed. The answer is the maximum number of rounds for all elements. Build an array dp to hold this information where the answer is the maximum value of dp.",