Solving Median of Two Sorted Arrays in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0

Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

![](https://img.halfrost.com/Leetcode/leetcode_4.png)

See the full details of the problem Median of Two Sorted Arrays at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go