coder-xiaomo/leetcode-problemset
1
0
Fork 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

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

2
leetcode/originData/maximize-number-of-subsequences-in-a-string.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 17601, \"totalSubmissionRaw\": 51641, \"acRate\": \"34.1%\"}",
"stats": "{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 17606, \"totalSubmissionRaw\": 51653, \"acRate\": \"34.1%\"}",
"hints": [
"Find the optimal position to add pattern[0] so that the number of subsequences is maximized. Similarly, find the optimal position to add pattern[1].",
"For each of the above cases, count the number of times the pattern occurs as a subsequence in text. The larger count is the required answer."