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

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
        int a1 = 0, a2 = 0;
        int index = 0;
        int res = 0;
        
        while(a1 < arr1.size() && a2 < arr2.size()){
            if(arr1[a1] < arr2[a2]){
                res = arr1[a1];
                a1++;
            }
            else{
                res = arr2[a2];
                a2++;
            }
            if(index == arr1.size()-1){
                return res;
            }
            index++;
        }
        
        if(index != arr1.size()-1 && a1 < arr1.size()){
            res = arr1[a1 + arr1.size() - 1 - index];
        }
        else if(index != arr1.size()-1 && a2 < arr2.size()){
            res = arr2[a2 + arr1.size() - 1 - index];
        }
        
        return res;
    }
};