coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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-operations-to-make-the-array-k-increasing.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 11967, \"totalSubmissionRaw\": 31416, \"acRate\": \"38.1%\"}",
"stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 11968, \"totalSubmissionRaw\": 31418, \"acRate\": \"38.1%\"}",
"hints": [
"Can we divide the array into non-overlapping subsequences and simplify the problem?",
"In the final array, arr[i-k] ≤ arr[i] should hold. We can use this to divide the array into at most k non-overlapping sequences, where arr[i] will belong to the (i%k)th sequence.",