coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
leetcode/originData/sum-of-scores-of-built-strings.json
View File

@@ -11,14 +11,51 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 59,
"dislikes": 108,
"likes": 115,
"dislikes": 150,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Happy Prefix\", \"titleSlug\": \"longest-happy-prefix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "\"babab\"\n\"azbazbzaz\"",
"categoryTitle": "Algorithms",
"contributors": [],
"topicTags": [],
"topicTags": [
{
"name": "String",
"slug": "string",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Binary Search",
"slug": "binary-search",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Rolling Hash",
"slug": "rolling-hash",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Suffix Array",
"slug": "suffix-array",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "String Matching",
"slug": "string-matching",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Hash Function",
"slug": "hash-function",
"translatedName": null,
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": [
{
@@ -130,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 1696, \"totalSubmissionRaw\": 6673, \"acRate\": \"25.4%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 3222, \"totalSubmissionRaw\": 9716, \"acRate\": \"33.2%\"}",
"hints": [
"Each s_i is a suffix of the string s, so consider algorithms that can determine the longest prefix that is also a suffix.",
"Could you use the Z array from the Z algorithm to find the score of each s_i?"