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

2
leetcode-cn/originData/consecutive-characters.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"62.3K\", \"totalSubmission\": \"103.5K\", \"totalAcceptedRaw\": 62298, \"totalSubmissionRaw\": 103459, \"acRate\": \"60.2%\"}",
"stats": "{\"totalAccepted\": \"62.3K\", \"totalSubmission\": \"103.5K\", \"totalAcceptedRaw\": 62303, \"totalSubmissionRaw\": 103465, \"acRate\": \"60.2%\"}",
"hints": [
"Keep an array power where power[i] is the maximum power of the i-th character.",
"The answer is max(power[i])."