double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) {
int newLen = (nums1Size+nums2Size)/2+1;
int i = 0;
int j = 0;
int newArr[newLen];
double ret;
while((i+j)<newLen && i<nums1Size && j<nums2Size){
if(nums1[i]<nums2[j]){
newArr[i+j] = nums1[i];
i++;
}else{
newArr[i+j] = nums2[j];
j++;
}
}
if(i<nums1Size && (i+j)<newLen) {
newArr[newLen-1] = nums1[newLen-j-1];
}
if(j<nums2Size && (i+j)<newLen) {
newArr[newLen-1] = nums2[newLen-i-1];
}
if((nums1Size+nums2Size)&1) {
ret = newArr[newLen-1];
}else{
if(i<nums1Size && (i+j)<newLen && newArr[newLen-2] != nums2[j-1]) {
newArr[newLen-2] = nums1[newLen-j-2];
}
if(j<nums2Size && (i+j)<newLen && newArr[newLen-2] != nums1[i-1]) {
newArr[newLen-2] = nums2[newLen-i-2];
}
ret = (double)(newArr[newLen-1]+newArr[newLen-2])/2;
}
return ret;
}
我应该把它写的好看点的,以后再想想吧