leetcode 4. Median of Two Sorted Arrays

最新推荐文章于 2025-12-19 16:34:09 发布

原创最新推荐文章于 2025-12-19 16:34:09 发布 · 362 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #4. Median of Two Sor

leetCode OJ 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种寻找两个有序数组中位数的方法，确保整体运行时间复杂度为O(log(m+n))。通过实例演示了如何实现该算法。

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

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

public class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int i=0,j=0;
        int size=(nums1.length+nums2.length);
        int[] temp=new int[size/2+1];
        boolean flag=false;
        if((nums1.length+nums2.length)%2==0)
        flag=true;
        int k=0;
        while(i<nums1.length&&j<nums2.length){
            if(nums1[i]<nums2[j]){
                temp[k++]=nums1[i++];
            }else{
                temp[k++]=nums2[j++];
            }
            if(k==size/2+1){
                if(flag)return (temp[k-1]+temp[k-2])*100/100.0/2.0;
                else return temp[k-1];
            }
        }
        while(k<=size/2){
        while(k<=size/2&&i<nums1.length)
            temp[k++]=nums1[i++];
        while(k<=size/2&&j<nums2.length)
            temp[k++]=nums2[j++];
       }
        
                if(flag)return ((temp[k-1]+temp[k-2])*100)/100.0/2.0;
                else return temp[k-1];
            
    }
}