Class Solution
- java.lang.Object
-
- g1701_1800.s1754_largest_merge_of_two_strings.Solution
-
public class Solution extends Object
1754 - Largest Merge Of Two Strings.Medium
You are given two strings
word1andword2. You want to construct a stringmergein the following way: while eitherword1orword2are non-empty, choose one of the following options:- If
word1is non-empty, append the first character inword1tomergeand delete it fromword1.- For example, if
word1 = "abc"andmerge = "dv", then after choosing this operation,word1 = "bc"andmerge = "dva".
- For example, if
- If
word2is non-empty, append the first character inword2tomergeand delete it fromword2.- For example, if
word2 = "abc"andmerge = "", then after choosing this operation,word2 = "bc"andmerge = "a".
- For example, if
Return the lexicographically largest
mergeyou can construct.A string
ais lexicographically larger than a stringb(of the same length) if in the first position whereaandbdiffer,ahas a character strictly larger than the corresponding character inb. For example,"abcd"is lexicographically larger than"abcc"because the first position they differ is at the fourth character, anddis greater thanc.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”
Constraints:
1 <= word1.length, word2.length <= 3000word1andword2consist only of lowercase English letters.
- If
-
-
Constructor Summary
Constructors Constructor Description Solution()
-