describe

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
Copy the code

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
Copy the code

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
Copy the code

Note:

1 <= word1.length, word2.length <= 100
word1 and word2 consist of lowercase English letters.
Copy the code

parsing

The result can be obtained by appending each character in word1 and word2 to the end of the new string res alternately, and then appending the extra string from the longer string directly to the end of the res.

answer

 class Solution(object):
    def mergeAlternately(self, word1, word2):
        """
        :type word1: str
        :type word2: str
        :rtype: str
        """
        res = ''
        min_length = min(len(word2), len(word1))
        for i in range(min_length):
            res = res + word1[i] + word2[i]
        res += word1[min_length:] + word2[min_length:]
        return res           	      
		
Copy the code

The results

Each node in the Python online submission list has a given array connected to each node. Each node in Python online submissions for Merge Strings connections.Copy the code

Original link: leetcode.com/problems/me…

Your support is my biggest motivation