河南疫情防控最新消息_宝安最好的网站建设_网站seo关键词_长沙网站推广排名

题意： merge两个字符串拼接

https://leetcode.com/problems/merge-strings-alternately/description/

解答方案：双指针

class Solution {
public:string mergeAlternately(string word1, string word2) {string res = "";int i = 0;int j = 0;while( i < word1.size() || j < word2.size()) {if (i < word1.size()) {res += word1[i];i++;}if (j < word2.size()) {res += word2[j];j++;}}return res;}
};

算法复杂度O(len(word1) + len(word2))