LeetCode #4 Median of Two Sorted Arrays
2015-08-09 17:10
363 查看
题目原文
There are two sorted arrays nums1 and nums2 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)).这道题是第一道标为hard的题,要求求出两个已经排序好的数组的中位数,我们知道一个长度为n的排过序的数组A的中位数为A[n/2](奇数)或者(A[n/2-1]+A[n/2])/2(偶数),所以只需要把两个数组按照合并排序的方法合并再取下标就好了。当然,也可以不合并,直接在两个数组中从左往右数,每次优先数较小的那个。
下面的提交代码是合并的版本。
提交代码
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { vector<int> merge; auto itr1 = nums1.begin(); auto itr2 = nums2.begin(); while(itr1 != nums1.end() || itr2 != nums2.end()) { if(itr1 == nums1.end()) { merge.push_back(*itr2++); } else if(itr2 == nums2.end()) { merge.push_back(*itr1++); } else { merge.push_back(*itr1<*itr2?*itr1++ : *itr2++); } } if(merge.size() & 1) { return merge[merge.size() / 2 ]; } else { return (merge[merge.size()/2] + merge[merge.size()/2-1]*1.0)/2; } }
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解