编程题分类——搜索算法
目录
- 前言
- 正文
- 1. 两个有序的数组,求中位数
- 参考
前言
正文
1. 两个有序的数组,求中位数
方法一:
code
class Solution {
public:double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {int size1 = nums1.size();int size2 = nums2.size();int totalSize = size1+size2;int middle1 = INT_MIN;int middle2 = INT_MAX;int index1 = 0;int index2 = 0;for(int i = 0;i<=totalSize/2;i++){middle1 = middle2;if(index2>=size2||(index1<size1&&nums1[index1]<nums2[index2]))middle2 = nums1[index1++];elsemiddle2 = nums2[index2++];}if((totalSize%2)==0)return (middle1+middle2)/2.0;elsereturn middle2;}
};
参考
- 剑指Offer
- Leetcode 100题
编程题分类——搜索算法
目录
- 前言
- 正文
- 1. 两个有序的数组,求中位数
- 参考
前言
正文
1. 两个有序的数组,求中位数
方法一:
code
class Solution {
public:double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {int size1 = nums1.size();int size2 = nums2.size();int totalSize = size1+size2;int middle1 = INT_MIN;int middle2 = INT_MAX;int index1 = 0;int index2 = 0;for(int i = 0;i<=totalSize/2;i++){middle1 = middle2;if(index2>=size2||(index1<size1&&nums1[index1]<nums2[index2]))middle2 = nums1[index1++];elsemiddle2 = nums2[index2++];}if((totalSize%2)==0)return (middle1+middle2)/2.0;elsereturn middle2;}
};
参考
- 剑指Offer
- Leetcode 100题