-
Notifications
You must be signed in to change notification settings - Fork 21
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
57 additions
and
0 deletions.
There are no files selected for viewing
51 changes: 51 additions & 0 deletions
51
LeetCode/ProgrammingInGo/MergeAlternately/MergeAlternately.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
/*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. | ||
*/ | ||
|
||
package MergeAlternately | ||
|
||
func MergeAlternate(word1 string, word2 string) string { | ||
result := "" | ||
for i := 0; i < len(word1) || i < len(word2); i++ { | ||
if i < len(word1) { | ||
result += string(word1[i]) | ||
} | ||
if i < len(word2) { | ||
result += string(word2[i]) | ||
} | ||
} | ||
return result | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters