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

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) {
        int mid = arr1.size();

        int p1 =0, p2=0, count =0;
        int ans = 0;    //用一个变量记录答案，避免讨论是哪一个

        while( count < mid && p1 <= mid-1 && p2 <= mid-1 ){
            if(arr1[p1] < arr2[p2]){
                ans = arr1[p1];
                count++;
                p1++;
            }else{
                ans = arr2[p2];
                count ++;
                p2++;
            }
        }

        while(count < mid && p1 <=mid-1){
            ans = arr1[p1];
            count++;
            p1++;
        }

        while(count < mid && p1 <= mid-1){
            ans = arr2[p2];
            count ++;
            p2++;
        }

        return ans;  
    }
};