public class Solution {
public double FindMedianSortedArrays(int[] nums1, int[] nums2) {
double a = 0;
List<int> list = new List<int>();
int count = nums1.Length;
for (int i = 0; i < count; i++)
{
list.Add(nums1[i]);
}
int count1 = nums2.Length;
for (int i = 0; i < count1; i++)
{
list.Add(nums2[i]);
}
list.Sort();
int length = count + count1;
int pos1 = 0, pos2 = 0;
if (length % 2 != 0)
{
pos1 = length / 2 + 1;
pos2 = 0;
}
else
{
pos1 = length / 2;
pos2 = length / 2 + 1;
}
if (pos2 == 0)
a = list[pos1 - 1];
else
a = (list[pos1 - 1] + list[pos2 - 1]) / 2.0;
return a;
}
}