【LeetCode】4. 寻找两个正序数组的中位数 题目描述代码 题目描述 代码 class Solution { public: double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { int len1=nums1.size(); int len2=nums2.size(); int len =len1+len2; vector<int>nums(len1+len2); int p1=0;int p2=0;int p=0; while(p1<len1 && p2<len2) { if(nums1[p1]>nums2[p2]) { nums[p++]=nums2[p2++]; } else { nums[p++]=nums1[p1++]; } } while(p1<len1)//把p1或者p2剩余的放进nums里 { nums[p++]=nums1[p1++]; } while(p2<len2) { nums[p++]=nums2[p2++]; } if(len%2==1) { double mid; mid =nums[(len-1)/2]; return mid; } else{ double mid; mid=((double)nums[len/2]+(double)nums[(len/2)-1])/2; return mid; } } };