【LeetCode】#4寻找两个有序数组的中位数(Median of Two Sorted Arrays)

【LeetCode】#4寻找两个有序数组的中位数(Median of Two Sorted Arrays)

题目描述

给定两个大小为 m 和 n 的有序数组 nums1 和 nums2。
请你找出这两个有序数组的中位数，并且要求算法的时间复杂度为 O(log(m + n))。
你可以假设 nums1 和 nums2 不会同时为空。

示例

示例 1:

nums1 = [1, 3]
nums2 = [2]
则中位数是 2.0

示例 2:

nums1 = [1, 2]
nums2 = [3, 4]
则中位数是 (2 + 3)/2 = 2.5

Description

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

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

解法

class Solution{
	public double findMedianSortedArrays(int[] nums1, int[] nums2){
		if(nums1.length==0){
			int n = nums2.length/2;
			if(nums2.length%2==0){
				return (double) (nums2[n-1]+nums2[n])/2.0;
			}else{
				return (double) nums2[n];
			}
		}
		if(nums2.length==0){
			int n = nums1.length/2;
			if(nums1.length%2==0){
				return (double) (nums1[n-1]+nums1[n])/2.0;
			}else{
				return (double) nums1[n];
			}
		}

		int[] nums = new int[nums1.length+nums2.length];
		int t1 = 0, t2 = 0;
		int k = 0;
		for(int i=0; i<nums.length; i++){
			k = i;
			if(t1==nums1.length){
				break;
			}
			if(t2==nums2.length){
				break;
			}
			if(nums1[t1]<nums2[t2]){
				nums[i] = nums1[t1++];
			}else{
				nums[i] = nums2[t2++];
			}
		}
		for(int i=k; i<nums.length; i++){
			if(t1<nums1.length){
				nums[i] = nums1[t1++];
			}
		}
		for(int i=k; i<nums.length; i++){
			if(t2<nums2.length){
				nums[i] = nums2[t2++];
			}
		}

		int num = nums.length/2;
		if(nums.length%2==0){
			return (double) (nums[num-1]+nums[num])/2.0;
		}else{
			return (double) nums[num];
		}
	}
}