#1754

Largest Merge Of Two Strings

specialist · 830 · lc medium +31 · verified · 53.5% accepted · 612 likes · top 45%

Description

You are given two strings word1 and word2. Build merge by repeatedly taking the first character of whichever non-empty string is lexicographically larger (or either, if equal). Return the lexicographically largest merge possible.

Example 1:

Input: word1 = "cabaa", word2 = "bcaaa"

Output: "cbcabaaaaa"

Explanation: One way to get the lexicographically largest merge is:

- Take from word1: merge = "c", word1 = "abaa", word2 = "bcaaa"

- Take from word2: merge = "cb", word1 = "abaa", word2 = "caaa"

- Take from word2: merge = "cbc", word1 = "abaa", word2 = "aaa"

- Take from word1: merge = "cbca", word1 = "baa", word2 = "aaa"

- Take from word1: merge = "cbcab", word1 = "aa", word2 = "aaa"

- Append the remaining 5 a's from word1 and word2 at the end of merge.

Example 2:

Input: word1 = "abcabc", word2 = "abdcaba"

Output: "abdcabcabcaba"

Code

1

2

3

class Solution:
    def largestMerge(self, word1: str, word2: str) -> str:

class Solution:
    def largestMerge(self, word1: str, word2: str) -> str: