一、题目内容

二、题解

解法1：

思路

双指针，分治

代码

public class Solution {
    public int findMedianinTwoSortedAray (int[] arr1, int[] arr2) {
        // write code here
        int len1 = arr1.length;
        int len2 = arr2.length;
        int k = (len1+len2)/2;
        int index1 = 0,index2 = 0;
        int target = 0;
        for(int i = 0; i<k; i++){
            if(arr1[index1]<arr2[index2]){
                target = arr1[index1];
                index1++;
            }else{
                target = arr2[index2];
                index2++;
            }
        }
        return target;
    }
}