码迷,mamicode.com
首页 > 其他好文 > 详细

Median of Two Sorted Arrays

时间:2014-08-31 10:23:01      阅读:176      评论:0      收藏:0      [点我收藏+]

标签:style   blog   http   color   io   strong   ar   for   div   

 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         else
21         {
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

标签:style   blog   http   color   io   strong   ar   for   div   

原文地址:http://www.cnblogs.com/sqxw/p/3947352.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!