Problem Statement
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n)). (link)
Example 1:
Input: nums1 = [1,3], nums2 = [2]
Output: 2....
