https://leetcode.com/problems/merge-strings-alternately/
class Solution {
public String mergeAlternately(String word1, String word2) {
int length1=word1.length();
int length2=word2.length();
String merged_word="";
if(length1==length2){
for(int i=0;i<length1;i++){
merged_word+=word1.substring(i,i+1)+word2.substring(i,i+1);
}
}else if(length1>length2){
for(int i=0;i<length2;i++){
merged_word+=word1.substring(i,i+1)+word2.substring(i,i+1);
}
merged_word+=word1.substring(length2);
}else{
for(int i=0;i<length1;i++){
merged_word+=word1.substring(i,i+1)+word2.substring(i,i+1);
}
merged_word+=word2.substring(length1);
}
return merged_word;
}
}
'JAVA' 카테고리의 다른 글
[백준/자바] 11399번: ATM (0) | 2023.07.18 |
---|---|
[리트코드/자바] 1431.kids with the greatest number of candies (0) | 2023.07.17 |
[프로그래머스/자바] Lv.0 삼각형의 완성조건(2) (0) | 2023.07.14 |
[백준/자바] 1253번: 좋다 (0) | 2023.07.11 |
[백준/자바] 1940번: 주몽 (0) | 2023.07.11 |
댓글