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/largest-merge-of-two-strings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 334,
"dislikes": 52,
"likes": 342,
"dislikes": 53,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"cabaa\"\n\"bcaaa\"\n\"abcabc\"\n\"abdcaba\"",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 13859, \"totalSubmissionRaw\": 31595, \"acRate\": \"43.9%\"}",
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"32.2K\", \"totalAcceptedRaw\": 14159, \"totalSubmissionRaw\": 32182, \"acRate\": \"44.0%\"}",
"hints": [
"Build the result character by character. At each step, you choose a character from one of the two strings.",
"If the next character of the first string is larger than that of the second string, or vice versa, it's optimal to use the larger one.",