[Hard]Median of Two Sorted Arrays

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)).

Example1

nums1 = [1, 3]
nums2 = [2]
The median is 2.0

Example2

nums1 = [1, 2]
nums2 = [3, 4]
The median is (2 + 3)/2 = 2.5

Solution

public class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int count = 0;
        int i = 0;
        int j = 0;
        int num[] = new int[(nums1.length+nums2.length)/2+1];
        while(count<=(nums1.length+nums2.length)/2){
            if(i==nums1.length){
                num[count] = nums2[j];
                j++;
            }else if(j==nums2.length){
                num[count] = nums1[i];
                i++;
            }else{
                if(nums1[i]>nums2[j]){
                    num[count] = nums2[j];
                    j++;
                }else{
                    num[count] = nums1[i];
                    i++;
                }
            }
            count++;

        }
        if((nums1.length+nums2.length)%2==0)
            return (num[(nums1.length+nums2.length)/2]+ num[(nums1.length+nums2.length)/2-1])/2.0;

        else
            return num[(nums1.length+nums2.length)/2];


    }
}

Analysis

题干要求时间复杂度为O(log(m+n)),很显然最多只能遍历两个数组总长度的一半才能满足该时间复杂度，而又因为两个数组是已经排好序的，因此可以新建一个数组存放结果集，分别按顺序比较nums1和nums2，并把较小的放入结果数据集。

此处如果在顺序比较时遇到某个数组已经遍历完时其实际上已经可以跳出break循环（理论上时间会更少，在leetcode上运行时反而增加了时间未知）。