Median of Two Sorted Arrays

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)). Test cases: Input: nums1 = [1, 3], nums2 = [2] Output: 2.0 Input: nums1 = [1, 2], nums2 = [3, 4] Output: 2.5 Input: nums1 = [0, 0], nums2 = [0, 0] Output: 0.0 Input: nums1 = [], nums2 = [1] Output: 1.0 Input: nums1 = [2], nums2 = [] Output: 2.0 Example Input [1, 3] [2]