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

4
leetcode/originData/[no content]number-of-same-end-substrings.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 7,
"likes": 8,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -21,7 +21,7 @@
"topicTags": [],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"174\", \"totalSubmission\": \"219\", \"totalAcceptedRaw\": 174, \"totalSubmissionRaw\": 219, \"acRate\": \"79.5%\"}",
"stats": "{\"totalAccepted\": \"213\", \"totalSubmission\": \"262\", \"totalAcceptedRaw\": 213, \"totalSubmissionRaw\": 262, \"acRate\": \"81.3%\"}",
"hints": [
"If there are <code>t</code> occurrences of a character in a substring, there exists <code>t * (t - 1) / 2</code> Same-End substrings with that character.",
"Try to calculate the number of occurrences of a character in a substring in <code>O(1)</code> using partial sum."