leetcode-0004-Median of Two Sorted Arrays

题目

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

You may assume nums1 and nums2 cannot be both empty.
Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0

Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

---

解题

解法一 暴力解法

比较直接暴力解法：

1. 将两个数据合并&排序
2. 取出中位数进行计算

  public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
    int[] nums = new int[nums1.length + nums2.length];
    System.arraycopy(nums1, 0, nums, 0, nums1.length);
    System.arraycopy(nums2, 0, nums, nums1.length, nums2.length);

    Arrays.sort(nums);
    
    return nums.length % 2 == 0 ? (double) (nums[nums.length / 2 - 1] + nums[nums.length / 2]) / 2
      : (double) nums[nums.length / 2];
  }

解法二

在上面的基础上有一些优化的空间，因为两个数组是排序好的。

1. 数组1的最大值 <= 数组2的最小值，整体是有序的
2. 数组1的最大值 > 数组2的最小值，取出数组2的最小值和最大值，判断数组2处于数组1的什么区间内；取中位数需要计算出下标

---

解法三

“What is the use of median”：

Dividing a set into two equal length subsets, that one subset is always greater than the other.

切分两个集合

          left_part          |        right_part
    A[0], A[1], ..., A[i-1]  |  A[i], A[i+1], ..., A[m-1]
    B[0], B[1], ..., B[j-1]  |  B[j], B[j+1], ..., B[n-1]

并且保证

1. len(left_part)=len(right_part)
2. max(left_part)≤min(right_part)

class Solution {
    public double findMedianSortedArrays(int[] A, int[] B) {
        int m = A.length;
        int n = B.length;
        if (m > n) { // to ensure m<=n
            int[] temp = A; A = B; B = temp;
            int tmp = m; m = n; n = tmp;
        }
        int iMin = 0, iMax = m, halfLen = (m + n + 1) / 2;
        while (iMin <= iMax) {
            int i = (iMin + iMax) / 2;
            int j = halfLen - i;
            if (i < iMax && B[j-1] > A[i]){
                iMin = i + 1; // i is too small
            }
            else if (i > iMin && A[i-1] > B[j]) {
                iMax = i - 1; // i is too big
            }
            else { // i is perfect
                int maxLeft = 0;
                if (i == 0) { maxLeft = B[j-1]; }
                else if (j == 0) { maxLeft = A[i-1]; }
                else { maxLeft = Math.max(A[i-1], B[j-1]); }
                if ( (m + n) % 2 == 1 ) { return maxLeft; }

                int minRight = 0;
                if (i == m) { minRight = B[j]; }
                else if (j == n) { minRight = A[i]; }
                else { minRight = Math.min(B[j], A[i]); }

                return (maxLeft + minRight) / 2.0;
            }
        }
        return 0.0;
    }
}

参考资料：
https://leetcode.com/problems/median-of-two-sorted-arrays/solution/