1
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
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 650,
"likes": 652,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Check if All A's Appears Before All B's\", \"titleSlug\": \"check-if-all-as-appears-before-all-bs\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 17657, \"totalSubmissionRaw\": 31694, \"acRate\": \"55.7%\"}",
"stats": "{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 17758, \"totalSubmissionRaw\": 31856, \"acRate\": \"55.7%\"}",
"hints": [
"You need to find for every index the number of Bs before it and the number of A's after it",
"You can speed up the finding of A's and B's in suffix and prefix using preprocessing"