refactor codewars

Author: dmitryburov

codewars/mergesort_merge_function/solution.go

@@ -3,25 +3,28 @@ package main
 func mergeSorted(arr1, arr2 []int) []int {
 	var result = make([]int, len(arr1)+len(arr2))
 
-	var i, j, k int
-	for ; k < len(result); k++ {
-		if i >= len(arr1) {
-			result[k] = arr2[j]
-			j++
-			continue
-		} else if j >= len(arr2) {
-			result[k] = arr1[i]
-			i++
-			continue
-		}
-
+	i, j, k := 0, 0, 0
+	for i < len(arr1) && j < len(arr2) {
 		if arr1[i] <= arr2[j] {
 			result[k] = arr1[i]
 			i++
 		} else {
 			result[k] = arr2[j]
 			j++
 		}
+		k++
+	}
+
+	for i < len(arr1) {
+		result[k] = arr1[i]
+		i++
+		k++
+	}
+
+	for j < len(arr2) {
+		result[k] = arr2[j]
+		j++
+		k++
 	}
 
 	return result