C# LeetCode 寻找两个正序数组的中位数

public double FindMedianSortedArrays(int[] nums1, int[] nums2) {
            decimal result;
            List<int> lists = new List<int>();
            lists.AddRange(nums1);
            lists.AddRange(nums2);
            lists.Sort();
            int numCount = lists.Count;
            int res = numCount % 2;
            int index = numCount / 2;
            if (res == 0)
            {
                decimal decimalRes = lists[index - 1] + lists[index];
                result = decimalRes / 2;
            }
            else 
            {
                result = lists[index];
            }
 
            return (double)result;
    }

 效率有点低，其他方式稍后再试