JAVA_LeetCode 1768_Merge Strings Alternately

JAVA_LeetCode 1768_Merge Strings Alternately 풀이 class Solution { public String mergeAlternately(String word1, String word2) { // 가장 작은 길이만큼 반복해서 더해준뒤, 차감된 길이만큼 남은 문자를 더해준다. StringBuilder sb = new StringBuilder(); int len1 = word1.length(), len2 = word2.length(); int min = Math.min(len1, len2); for(int i = 0; i < min; i++){ sb.append(word1.charAt(i)); sb.append(word2.charAt(i)); } if(len1 > len2) sb.append(word1.substring(min, len1)); else if(len2 > len1) sb.append(word2.substring(min, len2)); re...