median of two sorted arrays
来源:互联网 发布:网络恐怖主义案例 编辑:程序博客网 时间:2024/05/29 19:17
感觉这一题不难啊。用最常规的归并排序之后,找出中间的就行了。虽然不是最简单的方法,但一定是最方便的。
class Solution {public: double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2){ vector<int> tmp(nums1.size() + nums2.size()); int i = 0, j = 0, k = 0; while (i < nums1.size() && j < nums2.size()) if (nums1[i] <= nums2[j]) tmp[k++] = nums1[i++]; else tmp[k++] = nums2[j++]; while (i < nums1.size()) tmp[k++] = nums1[i++]; while (j < nums2.size()) tmp[k++] = nums2[j++]; int center = tmp.size() / 2; if (tmp.size() % 2) return tmp[center]; else return (double)(tmp[center] + tmp[center - 1]) / 2.0f; }};
对于已经排好序的,用归并排序复杂度是线性的:O(N)。
0 0
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of two sorted arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- median-of-two-sorted-arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- JDBC1
- mac下pdo链接错误
- 员工管理Java
- poj3525Most Distant Point from the Sea【半平面交求到凸多边形边界最远距离】
- 风机桨叶故障诊断(六) 利用自编码器进行特征学习
- median of two sorted arrays
- JAVA1
- mysq中的子查询
- 面试题7:用两个栈实现队列
- UITableView的简单实用
- CentOS 6.5 与 win7 双系统时间同步问题
- 同步工具类-闭锁CountDownLatch
- 简述Java内存泄露
- SCP 从服务器上传下载文件