coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31:42 +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

4
leetcode/originData/total-appeal-of-a-string.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1028,
"likes": 1029,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Unique Characters of All Substrings of a Given String\", \"titleSlug\": \"count-unique-characters-of-all-substrings-of-a-given-string\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Vowel Substrings of a String\", \"titleSlug\": \"count-vowel-substrings-of-a-string\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Vowels of All Substrings\", \"titleSlug\": \"vowels-of-all-substrings\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"50.6K\", \"totalAcceptedRaw\": 28065, \"totalSubmissionRaw\": 50554, \"acRate\": \"55.5%\"}",
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"50.6K\", \"totalAcceptedRaw\": 28080, \"totalSubmissionRaw\": 50585, \"acRate\": \"55.5%\"}",
"hints": [
"Consider the set of substrings that end at a certain index i. Then, consider a specific alphabetic character. How do you count the number of substrings ending at index i that contain that character?",
"The number of substrings that contain the alphabetic character is equivalent to 1 plus the index of the last occurrence of the character before index i + 1.",