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:
小墨
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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 190,
"likes": 216,
"dislikes": 12,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Common Subsequence\", \"titleSlug\": \"longest-common-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 9415, \"totalSubmissionRaw\": 31198, \"acRate\": \"30.2%\"}",
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 10591, \"totalSubmissionRaw\": 34358, \"acRate\": \"30.8%\"}",
"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."