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

class Solution {
public:

    int findMedianinTwoSortedAray(vector<int>& arr1, vector<int>& arr2) {
        // write code here
        //相当一设置两个指针
        int len1 = arr1.size();
        int len2 = arr2.size();
        int mid = (len1 + len2) / 2;

        int left = 0,right = 0;
        int ans = 0;
        for(int i = 1; i <= mid; i++){
            if(arr1[left] <= arr2[right]){
                ans = arr1[left];//每次记录一下当前的值
                left++;  
            } 
            else {
                ans = arr2[right];
                right++;
            }
        }
        return ans;
    }
};