leetcode-4

最新推荐文章于 2021-03-21 23:00:25 发布

嘤嘤怪QQQ

最新推荐文章于 2021-03-21 23:00:25 发布

阅读量127

点赞数

分类专栏：算法文章标签： java 动态规划算法 leetcode

本文链接：https://blog.csdn.net/zj20165149/article/details/103899096

版权

算法专栏收录该内容

44 篇文章 0 订阅

订阅专栏

leetcode-4

/*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*/

class Solution4 {

	    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
	        int m = nums1.length, n = nums2.length;
	        if (m < n) return findMedianSortedArrays(nums2, nums1);
	        if (n == 0) return (nums1[(m - 1) / 2] + nums1[m / 2]) / 2.0;
	        int left = 0, right = 2 * n;
	        while (left <= right) {
	            int mid2 = (left + right) / 2;
	            int mid1 = m + n - mid2;
	            double L1 = mid1 == 0 ? Double.MIN_VALUE : nums1[(mid1 - 1) / 2];
	            double L2 = mid2 == 0 ? Double.MIN_VALUE : nums2[(mid2 - 1) / 2];
	            double R1 = mid1 == m * 2 ? Double.MAX_VALUE : nums1[mid1 / 2];
	            double R2 = mid2 == n * 2 ? Double.MAX_VALUE : nums2[mid2 / 2];
	            if (L1 > R2) left = mid2 + 1;
	            else if (L2 > R1) right = mid2 - 1;
	            else return (Math.max(L1, L2) + Math.min(R1, R2)) / 2;
	        }
	        return -1;
	    }
	}