4. Median of Two Sorted Arrays

最新推荐文章于 2023-01-26 14:28:30 发布

happylife39

最新推荐文章于 2023-01-26 14:28:30 发布

阅读量156

点赞数

分类专栏：算法与数据结构

本文链接：https://blog.csdn.net/happylife39/article/details/52275853

版权

算法与数据结构专栏收录该内容

19 篇文章 0 订阅

订阅专栏

class Solution {
public:
double findMedianSortedArrays(vector& nums1, vector& nums2) {
int size1 = nums1.size();
int size2 = nums2.size();
if(size1 > size2)
return findMedianSortedArrays(nums2, nums1);
int left = 0;
int right = size1;
int i, j, num1, num2;
int mid = (size1 + size2 + 1 )>> 1;
while(left <= right)
{

        i = (left + right) >> 1;
        j = mid - i;
       if(i>0 && j<size2 && nums1[i-1] > nums2[j])
            right = i - 1;
       else if(j > 0 && i < size1 && nums2[j-1] > nums1[i])
            left = i + 1;
       else
        {
            if(i == 0)
               num1 = nums2[j-1];
            else if(j == 0)
               num1 = nums1[i-1];
            else
               num1 = max(nums1[i-1], nums2[j-1]);
            break;
        }

    }
    if((size1 + size2) & 1)
        return  num1;

    if(i == size1)
        num2 = nums2[j];
    else if(j == size2)
        num2 = nums1[i];
    else
        num2 = min(nums1[i], nums2[j]);

    return (num1 + num2)/2.0;
}

};