[LeetCode]Median of Two Sorted Arrays

原创于 2014-08-11 11:40:18 发布 · 662 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Java

LeetCode 专栏收录该内容

160 篇文章

订阅专栏

本文介绍了一个算法问题，即找到两个已排序数组的中位数，并提供了一个Java实现示例。该方法的时间复杂度为O(log(m+n))，符合高效查找的要求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There are two sorted arrays A and B 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)).

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        int l=0,r=0;
        int m=0;
        
        if(A.length==0&&B.length==0){
            return (Double) null;
        }
        
        if(A.length==0){
            if(B.length%2==0){
                return ((double)(B[B.length/2])+(double)(B[B.length/2-1]))/2;
            }else{
                return (double)(B[B.length/2]);
            }
        }
        
        if(B.length==0){
            if(A.length%2==0){
                return ((double)(A[A.length/2])+(double)(A[A.length/2-1]))/2;
            }else{
                return (double)(A[A.length/2]);
            }
        }
        
        int []C=new int [A.length+B.length];
        
        while(l<A.length&&r<B.length){
            if(A[l]<B[r]){
                C[m]=A[l];
                ++l;
                ++m;
            }else{
                C[m]=B[r];
                ++r;
                ++m;
            }
            
            if(l==A.length){
                while(r<B.length){
                    C[m]=B[r];
                    ++m;
                    ++r;
                }
                break;
            }
            
            if(B.length==r){
                while(l<A.length){
                    C[m]=A[l];
                    ++m;
                    ++l;
                }
                break;
            }
        }
        
        if(m%2==0){
            return ((double)(C[m/2])+(double)(C[m/2-1]))/2;
        }else{
            return (double)(C[m/2]);
        }
        
    }
}