【朱迪的LeetCode刷题笔记】1768. Merge Strings Alternately #Easy #Python #C++

Judie

You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.

Return the merged string.

Example 1:
Input: word1 = "abc", word2 = "pqr"
Output: "apbqcr"
Explanation: The merged string will be merged as so:
word1:  a   b   c
word2:    p   q   r
merged: a p b q c r

Example 2:
Input: word1 = "ab", word2 = "pqrs"
Output: "apbqrs"
Explanation: Notice that as word2 is longer, "rs" is appended to the end.
word1:  a   b
word2:    p   q   r   s
merged: a p b q   r   s

Example 3:
Input: word1 = "abcd", word2 = "pq"
Output: "apbqcd"
Explanation: Notice that as word1 is longer, "cd" is appended to the end.
word1:  a   b   c   d
word2:    p   q
merged: a p b q c   d

Constraints:
1 <= word1.length, word2.length <= 100
word1 and word2 consist of lowercase English letters.

Judy
Python

1. class Solution(object):
   
2.     def mergeAlternately(self, word1, word2):
   
3.         """
   
4.         :type word1: str
   
5.         :type word2: str
   
6.         :rtype: str
   
7.         """
   
8.         l1 = len(word1)
   
9.         l2 = len(word2)
   
10.         i1 = 0
    
11.         i2 = 0
    
12.         r = ""
    
13.         while i1 < l1 and i2 < l2:
    
14.             r += word1[i1] + word2[i2]
    
15.             i1 += 1
    
16.             i2 += 1
    
17.         r += word1[i1:] + word2[i2:]
    
18.         return r

复制代码

Gray
C++

1. class Solution {
   
2. public:
   
3.     string mergeAlternately(string word1, string word2) {
   
4.         int acc = 0;
   
5.         string ans;
   
6.         for(int i = 0; i < word1.size(); i++){
   
7.             ans += word1[i];
   
8.             if(acc == word2.size()){//走完
   
9.                 continue;
   
10.             }else {//没走完
    
11.                 ans+= word2[acc];
    
12.             }
    
13.             acc++;
    
14.         }
    
15.         if(acc < word2.size()){
    
16.             ans += word2.substr(acc,word2.size()-acc);
    
17.         }
    
18.         return ans;
    
19.     }
    
20. };

复制代码

Mike
C++

1. class Solution {
   
2. public:
   
3.     string mergeAlternately(string word1, string word2) {
   
4.         int index = 0;
   
5.         string s = "";
   
6.         int len1 = word1.length();
   
7.         int len2 = word2.length();
   
8.         int baselen = min(len1, len2);
   
9.         for (int index = 0; index < baselen; index++) {
   
10.             s += word1[index];
    
11.             s += word2[index];
    
12.         }
    
13.         if (word2.length() > word1.length()) {
    
14.             s += word2.substr(baselen, word2.length() - baselen);
    
15.         } else {
    
16.             s += word1.substr(baselen, word1.length() - baselen);
    
17.         }
    
18.         return s;
    
19.     }
    
20. };

复制代码