coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-operations-to-make-the-array-k-increasing.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 3749, \"totalSubmissionRaw\": 11413, \"acRate\": \"32.8%\"}",
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 3762, \"totalSubmissionRaw\": 11431, \"acRate\": \"32.9%\"}",
"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.",