Skip to content

Commit bbb62f3

Browse files
committed
feat: add solutions to lc problem: No.1768. Merge Strings Alternately
1 parent 4852b1c commit bbb62f3

File tree

5 files changed

+134
-2
lines changed

5 files changed

+134
-2
lines changed

solution/1700-1799/1768.Merge Strings Alternately/README.md

+46-1
Original file line numberDiff line numberDiff line change
@@ -66,15 +66,60 @@ word2: p q
6666
<!-- 这里可写当前语言的特殊实现逻辑 -->
6767

6868
```python
69-
69+
class Solution:
70+
def mergeAlternately(self, word1: str, word2: str) -> str:
71+
i, m, n = 0, len(word1), len(word2)
72+
res = []
73+
while i < m or i < n:
74+
if i < m:
75+
res.append(word1[i])
76+
if i < n:
77+
res.append(word2[i])
78+
i += 1
79+
return ''.join(res)
7080
```
7181

7282
### **Java**
7383

7484
<!-- 这里可写当前语言的特殊实现逻辑 -->
7585

7686
```java
87+
class Solution {
88+
public String mergeAlternately(String word1, String word2) {
89+
int m = word1.length(), n = word2.length();
90+
StringBuilder res = new StringBuilder();
91+
for (int i = 0; i < m || i < n; ++i) {
92+
if (i < m) {
93+
res.append(word1.charAt(i));
94+
}
95+
if (i < n) {
96+
res.append(word2.charAt(i));
97+
}
98+
}
99+
return res.toString();
100+
}
101+
}
102+
```
77103

104+
### **C++**
105+
106+
```cpp
107+
class Solution {
108+
public:
109+
string mergeAlternately(string word1, string word2) {
110+
int m = word1.size(), n = word2.size();
111+
string res;
112+
for (int i = 0; i < m || i < n; ++i) {
113+
if (i < m) {
114+
res.push_back(word1[i]);
115+
}
116+
if (i < n) {
117+
res.push_back(word2[i]);
118+
}
119+
}
120+
return res;
121+
}
122+
};
78123
```
79124
80125
### **...**

solution/1700-1799/1768.Merge Strings Alternately/README_EN.md

+46-1
Original file line numberDiff line numberDiff line change
@@ -98,13 +98,58 @@ merged: a p b q c d
9898
### **Python3**
9999

100100
```python
101-
101+
class Solution:
102+
def mergeAlternately(self, word1: str, word2: str) -> str:
103+
i, m, n = 0, len(word1), len(word2)
104+
res = []
105+
while i < m or i < n:
106+
if i < m:
107+
res.append(word1[i])
108+
if i < n:
109+
res.append(word2[i])
110+
i += 1
111+
return ''.join(res)
102112
```
103113

104114
### **Java**
105115

106116
```java
117+
class Solution {
118+
public String mergeAlternately(String word1, String word2) {
119+
int m = word1.length(), n = word2.length();
120+
StringBuilder res = new StringBuilder();
121+
for (int i = 0; i < m || i < n; ++i) {
122+
if (i < m) {
123+
res.append(word1.charAt(i));
124+
}
125+
if (i < n) {
126+
res.append(word2.charAt(i));
127+
}
128+
}
129+
return res.toString();
130+
}
131+
}
132+
```
107133

134+
### **C++**
135+
136+
```cpp
137+
class Solution {
138+
public:
139+
string mergeAlternately(string word1, string word2) {
140+
int m = word1.size(), n = word2.size();
141+
string res;
142+
for (int i = 0; i < m || i < n; ++i) {
143+
if (i < m) {
144+
res.push_back(word1[i]);
145+
}
146+
if (i < n) {
147+
res.push_back(word2[i]);
148+
}
149+
}
150+
return res;
151+
}
152+
};
108153
```
109154
110155
### **...**
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
class Solution {
2+
public:
3+
string mergeAlternately(string word1, string word2) {
4+
int m = word1.size(), n = word2.size();
5+
string res;
6+
for (int i = 0; i < m || i < n; ++i) {
7+
if (i < m) {
8+
res.push_back(word1[i]);
9+
}
10+
if (i < n) {
11+
res.push_back(word2[i]);
12+
}
13+
}
14+
return res;
15+
}
16+
};
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
class Solution {
2+
public String mergeAlternately(String word1, String word2) {
3+
int m = word1.length(), n = word2.length();
4+
StringBuilder res = new StringBuilder();
5+
for (int i = 0; i < m || i < n; ++i) {
6+
if (i < m) {
7+
res.append(word1.charAt(i));
8+
}
9+
if (i < n) {
10+
res.append(word2.charAt(i));
11+
}
12+
}
13+
return res.toString();
14+
}
15+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
class Solution:
2+
def mergeAlternately(self, word1: str, word2: str) -> str:
3+
i, m, n = 0, len(word1), len(word2)
4+
res = []
5+
while i < m or i < n:
6+
if i < m:
7+
res.append(word1[i])
8+
if i < n:
9+
res.append(word2[i])
10+
i += 1
11+
return ''.join(res)

0 commit comments

Comments
 (0)