leetcode-go/hard/4.go

package main

import (
	"fmt"
)

// nums1 & nums2 is not empty
func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
	midIdx1 := len(nums1) / 2
	var mid1 float64
	if len(nums1)%2 == 0 {
		mid1 = float64(nums1[midIdx1-1]+nums1[midIdx1]) / 2
	} else {
		mid1 = float64(nums1[midIdx1])
	}
	return mid1
}

func main() {
	nums1 := []int{1, 2, 3}
	nums2 := []int{2, 5, 6}
	fmt.Println(findMedianSortedArrays(nums1, nums2))
}