參考資訊:
https://algo.monster/liteproblems/1768
題目:

解答:
class Solution {
public:
string mergeAlternately(string word1, string word2) {
int len1 = word1.size();
int len2 = word2.size();
int max_len = len1 > len2 ? len1 : len2;
string ret;
for (int i = 0; i < max_len; i++) {
if (i < len1) {
ret += word1[i];
}
if (i < len2) {
ret += word2[i];
}
}
return ret;
}
};