coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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": 333,
"dislikes": 51,
"likes": 334,
"dislikes": 52,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"cabaa\"\n\"bcaaa\"\n\"abcabc\"\n\"abdcaba\"",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 13837, \"totalSubmissionRaw\": 31559, \"acRate\": \"43.8%\"}",
"stats": "{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 13859, \"totalSubmissionRaw\": 31595, \"acRate\": \"43.9%\"}",
"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.",