coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36: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/longest-substring-of-one-repeating-character.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"4.8K\", \"totalAcceptedRaw\": 1645, \"totalSubmissionRaw\": 4760, \"acRate\": \"34.6%\"}",
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"4.8K\", \"totalAcceptedRaw\": 1691, \"totalSubmissionRaw\": 4834, \"acRate\": \"35.0%\"}",
"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.",