1768.go

// Source: https://leetcode.com/problems/merge-strings-alternately
// Title: Merge Strings Alternately
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// 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 main

import (
	"strings"
)

func mergeAlternately(word1 string, word2 string) string {
	sb := strings.Builder{}

	l1 := len(word1)
	l2 := len(word2)
	l := _min(l1, l2)

	for i := 0; i < l; i++ {
		sb.WriteByte(word1[i])
		sb.WriteByte(word2[i])
	}
	for i := l; i < l1; i++ {
		sb.WriteByte(word1[i])
	}
	for i := l; i < l2; i++ {
		sb.WriteByte(word2[i])
	}

	return sb.String()
}

func _min(a, b int) int {
	if a < b {
		return a
	}
	return b
}