class Solution {
public:
string mergeAlternately(string word1, string word2) {
int p1 = 0;
int p2 = 0;
string res = "";
while(p1 < word1.size() || p2 < word2.size())
{
if(p1 < word1.size())
res += word1[p1++];
if(p2 < word2.size())
res += word2[p2++];
}
return res;
}
};
LeetCode 每日一题题解: 1768. 交替合并字符串
最新推荐文章于 2024-05-28 15:08:53 发布