coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/originData/substring-with-largest-variance.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"65.5K\", \"totalSubmission\": \"140.8K\", \"totalAcceptedRaw\": 65527, \"totalSubmissionRaw\": 140804, \"acRate\": \"46.5%\"}",
"stats": "{\"totalAccepted\": \"65.5K\", \"totalSubmission\": \"140.8K\", \"totalAcceptedRaw\": 65534, \"totalSubmissionRaw\": 140825, \"acRate\": \"46.5%\"}",
"hints": [
"Think about how to solve the problem if the string had only two distinct characters.",
"If we replace all occurrences of the first character by +1 and those of the second character by -1, can we efficiently calculate the largest possible variance of a string with only two distinct characters?",