ab两个指针遍历两数组left和right记录每次ab指针对应的元素class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int m nums1.length; int n nums2.length; int len m n; int a 0; int b 0; int left -1; int right -1; for(int i 0;i len / 2;i){ left right; if(a m (b n || nums1[a] nums2[b])){ right nums1[a]; }else{ right nums2[b]; } } if(len % 2 0){ return (right left) / 2.0; }else{ return right; } } }