首页 > 代码库 > [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 n = A.length; int m = B.length; int num = m+n; int[] ab = new int[n+m]; for(int i=0;i<n;i++) { ab[i] = A[i]; } for(int i=0;i<m;i++) { ab[i+n] = B[i]; } Arrays.sort(ab); double medain; if((num)%2!=0) { medain = (double)ab[(num+1)/2-1]; } else { medain = (double)(ab[num/2-1]+ab[num/2])/2; } return medain; } }
[LeetCode] Median of Two Sorted Arrays
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。