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.
class Solution:
def mergeAlternately(self, word1: str, word2: str) -> str:
l=max(len(word1),len(word2))
print(l)
ans=""
for i in range(l):
try:
ans+=word1[i]
except:
pass
try:
ans+=word2[i]
except:
pass
print(ans)
return ans'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 905. Sort Array By Parity (0) | 2022.12.22 |
|---|---|
| 977. Squares of a Sorted Array (0) | 2022.12.22 |
| 344. Reverse String (0) | 2022.12.22 |
| 2108. Find First Palindromic String in the Array (0) | 2022.12.20 |
| 832. Flipping an Image (0) | 2022.12.20 |