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

6
leetcode/originData/minimum-length-of-string-after-deleting-similar-ends.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 266,
"dislikes": 17,
"likes": 274,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"ca\"\n\"cabaabac\"\n\"aabccabba\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 13278, \"totalSubmissionRaw\": 30777, \"acRate\": \"43.1%\"}",
"stats": "{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 13602, \"totalSubmissionRaw\": 31487, \"acRate\": \"43.2%\"}",
"hints": [
"If both ends have distinct characters, no more operations can be made. Otherwise, the only operation is to remove all of the same characters from both ends. We will do this as many times as we can.",
"Note that if the length is equal 1 the answer is 1"