LeetCode || Median of Two Sorted Arrays
来源:互联网 发布:dnf校园网打团网络冲突 编辑:程序博客网 时间:2024/05/19 16:38
第一种方法:
题目意思是用log(m+n)的时间复杂度,但这个明显是(m+n)log(m+n)的时间复杂度,明显不符合要求,但是还是通过了测试accept.
主要是一个sort算法。
注意当数量为偶数的时候,存在两个中数,需要求平均值。
时间是56ms,注意到最快解决方案里面是40ms。
class Solution {public: double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { for(int i = 0;i<nums2.size();i++) nums1.push_back(nums2[i]); sort(nums1.begin(), nums1.end()); if(nums1.size() %2 != 0) return nums1[nums1.size()/2]; else return (nums1[nums1.size()/2 -1] + nums1[nums1.size()/2])/2.0; }};
0 0
- LeetCode: Median of Two Sorted Arrays
- LeetCode Median of Two Sorted Arrays
- leetcode 26: Median of Two Sorted Arrays
- Leetcode 4 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-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
- 【转载】【leetcode】Median of Two Sorted Arrays
- LeetCode - Median of Two Sorted Arrays
- [LeetCode]Median of Two Sorted Arrays
- Framework-res.apk内容简介
- 多台计算机安装ssh
- 设计模式那点事--工厂方法模式
- java监听器示例
- android studio Process 'command
- LeetCode || Median of Two Sorted Arrays
- 互联网产品经理必读书籍
- SAP BW – Implementing Delta Updates in the Financial Domain
- XCode开发证书生成步骤
- Android listView 之万能Adapter
- JSONObject和JSONArray的排序
- Linux 学习 01 基本命令
- iOS计算项目有多少行代码
- mfc 在原有的按钮上添加位图