Leetcode之Median_of_Two_Sorted_Arrarys解法
2018-01-16 23:10
113 查看
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int a[100000], a_num = 0;
int i = 0, j = 0, x, y;
while(i < nums1.size() || j < nums2.size()){
x = i < nums1.size() ? nums1[i] : 99999999;
y = j < nums2.size() ? nums2[j] : 99999999;
a[a_num] = x > y ? (j++, y) : (i++, x);
a_num ++;
}
int all_size = nums1.size() + nums2.size();
if(all_size % 2){
return a[all_size / 2];
}
else{
return (a[all_size / 2] + a[all_size / 2 - 1]) / 2.0;
}
}
};用归并排序水过去了。。
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode 】 Median of Two Sorted Arrays 简单高效的解法
- Leetcode_Problem4_Median of Two Sorted Arrays(两种解法)
- [LeetCode P4] Median of Two Sorted Arrays 解法
- LeetCode之Median Of Two Sorted Arrays
- LeetCode 4 Median of Two Sorted Arrays 解题报告
- [LeetCode]Median of Two Sorted Arrays
- LeetCode之Median of Two Sorted Arrays
- LeetCode-4-Median of Two Sorted Arrays
- [c++]LeetCode Median of Two Sorted Arrays问题
- LeetCode-Algorithms #004 Median Of Two Sorted Arrays, Database #178 Rank Scores
- Median of Two Sorted Arrays - LeetCode
- LeetCode -- Median of Two Sorted Arrays
- leetcode 刷题日记——Median of Two Sorted Arrays
- LeetCode 之 Median of Two Sorted Arrays
- LeetCode - Median of Two Sorted Arrays
- LeetCode题目笔记(三) -- Median of Two Sorted Arrays
- LeetCode：Median of Two Sorted Arrays
- leetcode [004] : Median of Two Sorted Arrays
- [leetcode 4] Median of Two Sorted Arrays
- [LeetCode]Median of Two Sorted Arrays