给你两个字符串 word1 和 word2 。请你从 word1 开始,通过交替添加字母来合并字符串。如果一个字符串比另一个字符串长,就将多出来的字母追加到合并后字符串的末尾。
返回 合并后的字符串 。
示例 1:
输入:word1 = "abc", word2 = "pqr"
输出:"apbqcr"
解释:字符串合并情况如下所示:
word1: a b c
word2: p q r
合并后: a p b q c r
示例 2:
输入:word1 = "ab", word2 = "pqrs"
输出:"apbqrs"
解释:注意,word2 比 word1 长,"rs" 需要追加到合并后字符串的末尾。
word1: a b
word2: p q r s
合并后: a p b q r s
示例 3:
输入:word1 = "abcd", word2 = "pq"
输出:"apbqcd"
解释:注意,word1 比 word2 长,"cd" 需要追加到合并后字符串的末尾。
word1: a b c d
word2: p q
合并后: a p b q c d
提示:
1 <= word1.length, word2.length <= 100
word1 和 word2 由小写英文字母组成
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-strings-alternately
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
最简单直接的方法:直接依次遍历
char * mergeAlternately(char * word1, char * word2){
int lenWord1 = strlen(word1);
int lenWord2 = strlen(word2);
char *ans = malloc(sizeof(char) * (lenWord1 + lenWord2 + 2));
if (lenWord1 <= lenWord2) {
for (int i = 0; i < lenWord1; i++) {
ans[i * 2] = word1[i];
ans[i * 2 + 1] = word2[i];
}
if (lenWord1 < lenWord2) {
for (int i = 0; i < lenWord2 - lenWord1; i++) {
ans[lenWord1 * 2 + i] = word2[lenWord1 + i];
}
}
}
else {
for (int i = 0; i < lenWord2; i++) {
ans[i * 2] = word1[i];
ans[i * 2 + 1] = word2[i];
}
for (int i = 0; i < lenWord1 - lenWord2; i++) {
ans[lenWord2 * 2 + i] = word1[lenWord2 + i];
}
}
ans[lenWord1 + lenWord2] = '\0';
return ans;
}
看leetcode竞赛排名第二的一大神的code如下:
class Solution {
public:
string mergeAlternately(string word1, string word2) {
string r;
int a = word1.size();
int b = word2.size();
int n = max(a,b);
for (int i=0; i<n; ++i) {
if (i<a) r+= word1[i];
if (i<b) r+= word2[i];
}
return r;
}
};