题解 | #在两个长度相等的排序数组中找到上中位数#

class Solution {
public:
/**
* find median in two sorted array
* @param arr1 int整型vector the array1
* @param arr2 int整型vector the array2
* @return int整型
*/
int findMedianinTwoSortedAray(vector<int>& arr1, vector<int>& arr2) {
// write code here
//开辟新空间将arr1 和arr2进行合并
int len=arr1.size();
vector<int> temp;
int i=0,j=0;
while(i<len&&j<len)
{
if(arr1[i]<arr2[j])
{
temp.push_back(arr1[i]);
i++;
}
else if(arr1[i]>arr2[j])
{
temp.push_back(arr2[j]);
j++;
}
else
{</int></int></int>

            temp.push_back(arr1[i]);
            temp.push_back(arr2[j]);
            i++;
            j++;
        }
    }
    if(i<len-1)
    {
        temp.insert(temp.end(), arr1.begin()+i,arr1.end());

    }
    if(j<len-1)
        temp.insert(temp.end(), arr2.begin()+j,arr2.end());
    return temp[len-1];
}

};