-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproblem-1-merge-strings-alternately.js
107 lines (98 loc) · 2.51 KB
/
problem-1-merge-strings-alternately.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/**
* 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
*/
//My Solution:
/**
* @param {string} word1
* @param {string} word2
* @return {string}
*/
var mergeAlternately = function(word1, word2) {
// const arr1 =
let len = 0;
const len1 = word1.length;
const len2 = word2.length;
if (len1 > len2) {
len = len1;
} else {
len = len2;
}
let mergedWord = "";
for(let i=0; i<len;i++) {
if (i < len1) {
mergedWord += word1[i];
}
if (i < len2) {
mergedWord += word2[i];
}
}
console.log(mergedWord)
return mergedWord;
};
//Solution 2:
//Best solution with respect to time
/**
* @param {string} word1
* @param {string} word2
* @return {string}
*/
var mergeAlternately = function(word1, word2) {
const ret = new Array(word1.length + word2.length);
let i1 = 0;
let i2 = 0;
const minLen = Math.min(word1.length + word2.length);
for (let i = 0; i < minLen; i += 2) ret[i] = word1[i1++];
for (let i = 1; i < minLen; i += 2) ret[i] = word2[i2++];
for (i = minLen; i1 < word1.length; ++i) ret[i] = word1[i1++];
for (; i2 < word2.length; ++i) ret[i] = word2[i2++];
return ret.join("");
};
//Solution 3:
//Best Solution in terms of memory
/**
* @param {string} word1
* @param {string} word2
* @return {string}
*/
var mergeAlternately = function(word1, word2) {
let i=0;
let j=0;
let merge=[]
while(i<word1.length && j<word2.length){
merge.push(word1[i]);
i++;
merge.push(word2[j]);
j++;
}
while(i<word1.length){
merge.push(word1[i]);
i++
}
while(j<word2.length){
merge.push(word2[j]);
j++
}
return merge.join("")
};