首页 > 代码库 > [LeetCode]Median of Two Sorted Arrays
[LeetCode]Median of Two Sorted Arrays
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]); } } }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。