coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/find-all-good-strings.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 3854, \"totalSubmissionRaw\": 9524, \"acRate\": \"40.5%\"}",
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 3856, \"totalSubmissionRaw\": 9530, \"acRate\": \"40.5%\"}",
"hints": [
"Use DP with 4 states (pos: Int, posEvil: Int, equalToS1: Bool, equalToS2: Bool) which compute the number of valid strings of size \"pos\" where the maximum common suffix with string \"evil\" has size \"posEvil\". When \"equalToS1\" is \"true\", the current valid string is equal to \"S1\" otherwise it is greater. In a similar way when equalToS2 is \"true\" the current valid string is equal to \"S2\" otherwise it is smaller.",
"To update the maximum common suffix with string \"evil\" use KMP preprocessing."