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/originData/minimum-replacements-to-sort-the-array.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"61.4K\", \"totalSubmission\": \"113.7K\", \"totalAcceptedRaw\": 61419, \"totalSubmissionRaw\": 113717, \"acRate\": \"54.0%\"}",
"stats": "{\"totalAccepted\": \"61.4K\", \"totalSubmission\": \"113.7K\", \"totalAcceptedRaw\": 61433, \"totalSubmissionRaw\": 113742, \"acRate\": \"54.0%\"}",
"hints": [
"It is optimal to never make an operation to the last element of the array.",
"You can iterate from the second last element to the first. If the current value is greater than the previous bound, we want to break it into pieces so that the smaller one is as large as possible but not larger than the previous one."