LeetCode 1754 Largest Merge Of Two Strings (贪心)

You are given two strings word1 and word2. You want to construct a string merge in the following way: while either word1 or word2 are non-empty, choose one of the following options:

• If word1 is non-empty, append the first character in word1 to merge and delete it from word1.
  • For example, if word1 = "abc" and merge = "dv", then after choosing this operation, word1 = "bc" and merge = "dva".
• If word2 is non-empty, append the first character in word2 to merge and delete it from word2.
  • For example, if word2 = "abc" and merge = "", then after choosing this operation, word2 = "bc" and merge = "a".

Return the lexicographically largest merge you can construct.

A string a is lexicographically larger than a string b (of the same length) if in the first position where a and b differ, a has a character strictly larger than the corresponding character in b. For example, "abcd" is lexicographically larger than "abcc" because the first position they differ is at the fourth character, and d is greater than c.

 

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 <= 3000
• word1 and word2 consist only of lowercase English letters.

题目链接：https://leetcode.com/problems/largest-merge-of-two-strings/

题目大意：字典序最大合并两个字符串

题目分析：关键是相对位置相等时如何选择，依次向后判断即可，当某个串比完后，需继续向后比较（例如abc, abcabcc,需要比两次abc），这里可通过递归简单实现

22ms，时间击败93.48%

class Solution {   
    
    public boolean isW1Better(int i, int n, char[] w1, int j, int m, char[] w2) {
        int si = i, sj = j;
        while (i < n && j < m && w1[i] == w2[j]) {
            i++;
            j++;
        }
        if (i == n && j == m) {
            return true;
        }
        if (i == n) {
            return isW1Better(si, n, w1, j, m, w2);
        }
        if (j == m) {
            return isW1Better(i, n, w1, sj, m, w2);
        }
        return w1[i] > w2[j];
    }
    
    public String largestMerge(String word1, String word2) {
        StringBuilder sb = new StringBuilder("");
        int i = 0, j = 0, n = word1.length(), m = word2.length();
        char[] chars1 = word1.toCharArray();
        char[] chars2 = word2.toCharArray();
        while (i < n && j < m) {
            if (chars1[i] > chars2[j]) {
                sb.append(chars1[i]);
                i++;
            } else if (chars1[i] < chars2[j]) {
                sb.append(chars2[j]);
                j++;
            } else {
                if (isW1Better(i, n, chars1, j, m, chars2)) {
                    sb.append(chars1[i]);
                    i++;
                } else {
                    sb.append(chars2[j]);
                    j++;
                }
            }
        }
        if (i < n) {
            sb.append(word1.substring(i));
        }
        if (j < m) {
            sb.append(word2.substring(j));
        }
        return sb.toString();
    }
}