1754. Largest Merge Of Two Strings

這題最難的部分, 就是當相等要選誰

我花了很大的力氣再找後面可能會發生的case, 但看完discuss

忽然發現, 當遇到一樣的我們比string序位上較大的那個就好了

我傻眼

class Solution {
public:
   
    string largestMerge(string word1, string word2) {
       
        string merge = "";
        while(!word1.empty() && !word2.empty()){
            if(word1[0] > word2[0]){
merge += word1[0];
                word1.erase(0, 1);
            }else if (word1[0] < word2[0]){
                merge += word2[0];
                word2.erase(0, 1);
                
            }else{
               if(word1 > word2){
                    merge += word1[0];
                    word1.erase(0, 1);
               }else{
                    merge += word2[0];
                    word2.erase(0, 1);
               }
            }
       
        }
        if(!word1.empty()){
            merge += word1;
        }
        if(!word2.empty()){
            merge+= word2;
        }
       
        return merge;
    }
};