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-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

8
leetcode/originData/maximum-number-of-removable-characters.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 512,
"dislikes": 61,
"likes": 558,
"dislikes": 63,
"isLiked": null,
"similarQuestions": "[]",
"similarQuestions": "[{\"title\": \"Maximum Candies Allocated to K Children\", \"titleSlug\": \"maximum-candies-allocated-to-k-children\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"abcacb\"\n\"ab\"\n[3,1,0]\n\"abcbddddd\"\n\"abcd\"\n[3,2,1,4,5,6]\n\"abcab\"\n\"abc\"\n[0,1,2,3,4]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 11907, \"totalSubmissionRaw\": 33751, \"acRate\": \"35.3%\"}",
"stats": "{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 13080, \"totalSubmissionRaw\": 35759, \"acRate\": \"36.6%\"}",
"hints": [
"First, we need to think about solving an easier problem, If we remove a set of indices from the string does P exist in S as a subsequence",
"We can binary search the K and check by solving the above problem."