coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

4
leetcode/originData/minimum-number-of-operations-to-make-array-continuous.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1784,
"likes": 1785,
"dislikes": 46,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Continuous Subarray Sum\", \"titleSlug\": \"continuous-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Moving Stones Until Consecutive II\", \"titleSlug\": \"moving-stones-until-consecutive-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum One Bit Operations to Make Integers Zero\", \"titleSlug\": \"minimum-one-bit-operations-to-make-integers-zero\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Adjacent Swaps for K Consecutive Ones\", \"titleSlug\": \"minimum-adjacent-swaps-for-k-consecutive-ones\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"70K\", \"totalSubmission\": \"130.9K\", \"totalAcceptedRaw\": 69977, \"totalSubmissionRaw\": 130914, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"70K\", \"totalSubmission\": \"130.9K\", \"totalAcceptedRaw\": 69983, \"totalSubmissionRaw\": 130921, \"acRate\": \"53.5%\"}",
"hints": [
"Sort the array.",
"For every index do a binary search to get the possible right end of the window and calculate the possible answer."