leetcode-go/medium/553.optimal-division.go

func optimalDivision(nums []int) string {
	n := len(nums)
	if n == 1 { // It's math!
		return fmt.Sprintf("%d", nums[0])
	} else if n == 2 {
		return fmt.Sprintf("%d/%d", nums[0], nums[1])
	}
	var sb strings.Builder
	sb.WriteString(fmt.Sprintf("%d/(%d", nums[0], nums[1]))
	for i := 2; i < n; i++ {
		sb.WriteString(fmt.Sprintf("/%d", nums[i]))
	}
	sb.WriteRune(')')
	return sb.String()
}