首页 > 代码库 > Median of Two Sorted Arrays
Median of Two Sorted Arrays
1 class Solution { 2 public: 3 double findMedianSortedArrays(int A[], int m, int B[], int n) { 4 vector<int> v(m+n); 5 for(int i=0;i<m;i++) 6 { 7 v[i]=A[i]; 8 } 9 for(int j=0;j<n;j++)10 {11 v[m+j]=B[j];12 }13 14 sort(v.begin(),v.end());15 16 if((m+n)%2==0)17 {18 return (v[(m+n)/2-1]+v[(m+n)/2])*0.5;19 }20 else21 {22 return v[(m+n)/2];23 }24 25 }26 };
Total Accepted: 18746 Total Submissions: 108234My Submissions
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)).
Median of Two Sorted Arrays
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。