/**
* find median in two sorted array
* @param arr1 int整型一维数组 the array1
* @param arr1Len int arr1数组长度
* @param arr2 int整型一维数组 the array2
* @param arr2Len int arr2数组长度
* @return int整型
*/
int findMedianinTwoSortedAray(int* arr1, int arr1Len, int* arr2, int arr2Len )
{
// write code here
int k = 0;
int i = 0, j = 0;
while (k < arr1Len)
{
while (arr1[i] < arr2[j])
{
if (k == arr1Len - 1)
return arr1[i];
i++;
k++;
}
while (arr1[i] >= arr2[j])
{
if (k == arr1Len - 1)
return arr2[j];
j++;
k++;
}
}
return 0;
}