findMedianSortedArrays 基本思路:通过指针按顺序移动来判断大小顺序,思路和有一道用链表求中间值一样: class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { double mediumNum = 0; //判断奇偶,取中间还是平均 boolean odd = true; mediumNum = (nums1.length+nums2.length)/2 + 1; if…