Add: median_of_two_sorted_arrays

problems/median-of-two-sorted-arrays/median_of_two_sorted_arrays.go

@@ -1 +1,31 @@
 package median_of_two_sorted_arrays
+
+func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
+m, n := len(nums1), len(nums2)
+s := make([]int, 0, m+n)
+i, j := 0, 0
+for i < m && j < n {
+v1 := nums1[i]
+v2 := nums2[j]
+if v1 <= v2 {
+s = append(s, v1)
+i++
+} else {
+s = append(s, v2)
+j++
+}
+}
+if i < m {
+s = append(s, nums1[i:]...)
+} else {
+s = append(s, nums2[j:]...)
+}
+count := m + n
+if count&1 == 1 {
+k := (count - 1) / 2
+return float64(s[k])
+} else {
+k := count / 2
+return (float64(s[k-1]) + float64(s[k])) / 2
+}
+}

problems/median-of-two-sorted-arrays/median_of_two_sorted_arrays_test.go

@@ -1 +1,81 @@
 package median_of_two_sorted_arrays
+
+import "testing"
+
+type caseType struct {
+num1 []int
+num2 []int
+expected float64
+}
+
+func TestFindMedianSortedArrays(t *testing.T) {
+tests := [...]caseType{
+{
+num1: []int{1, 3},
+num2: []int{2},
+expected: 2.0,
+},
+{
+num1: []int{1, 2},
+num2: []int{3, 4},
+expected: 2.5,
+},
+{
+num1: []int{1, 3, 5, 7},
+num2: []int{2, 4},
+expected: 3.5,
+},
+{
+num1: []int{1, 3, 5},
+num2: []int{},
+expected: 3,
+},
+{
+num1: []int{1, 2},
+num2: []int{3},
+expected: 2,
+},
+{
+num1: []int{1, 1},
+num2: []int{1, 1},
+expected: 1,
+},
+{
+num1: []int{1, 1, 1},
+num2: []int{1, 1},
+expected: 1,
+},
+{
+num1: []int{1, 1},
+num2: []int{1, 1, 1},
+expected: 1,
+},
+{
+num1: []int{1},
+num2: []int{2, 3, 4},
+expected: 2.5,
+},
+{
+num1: []int{2, 3, 4},
+num2: []int{1},
+expected: 2.5,
+},
+{
+num1: []int{},
+num2: []int{1},
+expected: 1,
+},
+{
+num1: []int{},
+num2: []int{1, 1},
+expected: 1,
+},
+}
+
+for _, tc := range tests {
+output := findMedianSortedArrays(tc.num1, tc.num2)
+if output != tc.expected {
+t.Fatalf("input: %v %v, output: %v, expected: %v", tc.num1, tc.num2, output, tc.expected)
+}
+}
+}