Largest Merge Of Two Strings LeetCode solution in C++

1
class Solution {
2
 public:
3
  string largestMerge(string word1, string word2) {
4
    string ans = "";
5

6
    while (word1.size() != 0 && word2.size() != 0) {
7
      if (word1 >= word2) {
8
        ans += word1[0];
9
        word1 = word1.substr(1);
10
      }
11

12
      else {
13
        ans += word2[0];
14
        word2 = word2.substr(1);
15
      }
16
    }
17

18
    if (word1.size() != 0) ans = ans + word1;
19
    if (word2.size() != 0) ans = ans + word2;
20

21
    return ans;
22
  }
23
};