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

6
leetcode/originData/longest-substring-of-one-repeating-character.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 64,
"dislikes": 56,
"likes": 67,
"dislikes": 57,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Merge Intervals\", \"titleSlug\": \"merge-intervals\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Consecutive Characters\", \"titleSlug\": \"consecutive-characters\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Create Sorted Array through Instructions\", \"titleSlug\": \"create-sorted-array-through-instructions\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "\"babacc\"\n\"bcb\"\n[1,3,3]\n\"abyzz\"\n\"aa\"\n[2,1]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 1523, \"totalSubmissionRaw\": 5602, \"acRate\": \"27.2%\"}",
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 1587, \"totalSubmissionRaw\": 5806, \"acRate\": \"27.3%\"}",
"hints": [
"Use a segment tree to perform fast point updates and range queries.",
"We need each segment tree node to store the length of the longest substring of that segment consisting of only 1 repeating character.",