4. Median of Two Sorted Arrays

Posted 2020-07-31 HenRy

Difficulty: Hard

here are two sorted arrays nums1 and nums2 of size m and n respectively.

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

My submission 1 Runtime:240ms

 1 public double FindMedianSortedArrays(int[] nums1, int[] nums2) {
 2         List<int> list1=nums1.ToList();
 3         List<int> list2=nums2.ToList();
 4         list1.AddRange(list2);
 5         list1.Sort();
 6         int n = list1.Count%2;
 7         int mid=list1.Count/2;
 8         if(list1.Count==0) return 0;
 9         if(list1.Count==1) return list1[0];
10         if(n==1)
11         {
12             return list1[mid];
13         }
14         else
15         {
16             return (double)(list1[mid-1]+list1[mid])/2;
17         }
18     }

C# Code