Median of Two Sorted Arrays

题目

There 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)).

译文

有两个排序数组nums1和nums2，长度分别为m和n。找出这两个数组的中数。要求时间复杂度为O(log(m+n)。

分析

hard

我的代码

double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {

}