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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 461,
"likes": 472,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Increasing Subsequence\", \"titleSlug\": \"longest-increasing-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Swaps To Make Sequences Increasing\", \"titleSlug\": \"minimum-swaps-to-make-sequences-increasing\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 8216, \"totalSubmissionRaw\": 22735, \"acRate\": \"36.1%\"}",
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 8481, \"totalSubmissionRaw\": 23301, \"acRate\": \"36.4%\"}",
"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.",