LeetCode T4 Median of Two Sorted Arrays

题目地址：

中文：https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
英文：https://leetcode.com/problems/median-of-two-sorted-arrays/

题目描述：

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

Follow up: The overall run time complexity should be O(log (m+n)).
Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation:merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

Example 3:

Input: nums1 = [0,0], nums2 = [0,0]
Output: 0.00000

Example 4:

Input: nums1 = [], nums2 = [1]
Output: 1.00000

Example 5:

Input: nums1 = [2], nums2 = []
Output: 2.00000

Constraints:

nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106

思路：

合并两个有序数组为一个有序数组，然后求中位数就好了。

题解：

class Solution {
    public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int m=0,n=0,k=0;
        int len1 = nums1.length;
        int len2 = nums2.length;
        int res[] = new int[len1+len2];
        double res_d = 0;
        //归并一下
        while(m<len1 || n<len2){
            while(m<len1 && n<len2 && nums1[m]<nums2[n]){
                res[k++] = nums1[m++];
            }
            while(m<len1 && n<len2 && nums1[m]>=nums2[n]){
                res[k++] = nums2[n++];
            }

            if(m<len1 && n>=len2){//如果nums2空了
                while(m<len1)
                    res[k++] = nums1[m++];
            }
            if(m>=len1 && n<len2){
                while(n<len2)
                    res[k++] = nums2[n++];
            }
        }

        if((len1+len2)%2==0) res_d = (Double.valueOf(res[(len1+len2-1)/2])+Double.valueOf(res[(len1+len2)/2]))/2.0;
        else res_d = Double.valueOf(res[(len1+len2-1)/2]);
        return res_d;
    }
}