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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/maximize-the-confusion-of-an-exam.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 419,
"likes": 422,
"dislikes": 9,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Substring with At Most K Distinct Characters\", \"titleSlug\": \"longest-substring-with-at-most-k-distinct-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Days to Make m Bouquets\", \"titleSlug\": \"minimum-number-of-days-to-make-m-bouquets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"22.1K\", \"totalAcceptedRaw\": 12502, \"totalSubmissionRaw\": 22120, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 12629, \"totalSubmissionRaw\": 22312, \"acRate\": \"56.6%\"}",
"hints": [
"Can we use the maximum length at the previous position to help us find the answer for the current position?",
"Can we use binary search to find the maximum consecutive same answer at every position?"