【LeetCode】4. Median of Two Sorted Arrays
来源:互联网 发布:七天天网络 编辑:程序博客网 时间:2024/06/16 20:48
题解:二分法,本题一般情况是查找第k大的数,由于是有序数组可以借鉴二分查找的思想,每次查找从k/2开始筛选
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { int len1=nums1.size(); int len2=nums2.size(); int len= len1+len2; if(len%2){ return findKth(nums1,0,nums2,0,len/2+1); } return (findKth(nums1,0,nums2,0,len/2)+findKth(nums1,0,nums2,0,len/2+1))/2;}double findKth(vector<int>& nums1,int n1, vector<int>& nums2,int n2,int k) { if(n1>=nums1.size()) return nums2[k+n2-1]; if(n2>=nums2.size()) return nums1[k+n1-1]; if(k==1) return min(nums1[n1],nums2[n2]); int ky1=n1+k/2-1>=nums1.size()?INT_MAX:nums1[n1+k/2-1]; int ky2=n2+k/2-1>=nums2.size()?INT_MAX:nums2[n2+k/2-1]; if(ky1<ky2) return findKth(nums1,n1+k/2,nums2,n2,k-k/2); else return findKth(nums1,n1,nums2,n2+k/2,k-k/2); }
阅读全文
0 0
- [LeetCode]4.Median of Two Sorted Arrays
- LeetCode 4. Median of Two Sorted Arrays
- LeetCode --- 4. Median of Two Sorted Arrays
- [Leetcode] 4. Median of Two Sorted Arrays
- [LeetCode]4.Median of Two Sorted Arrays
- 【leetcode】4. Median of Two Sorted Arrays
- Leetcode-4.Median of Two Sorted Arrays
- LeetCode-4.Median of Two Sorted Arrays
- Leetcode 4. Median of Two Sorted Arrays
- leetcode 4. Median of Two Sorted Arrays
- LeetCode 4. Median of Two Sorted Arrays
- Leetcode 4. Median of Two Sorted Arrays
- Leetcode 4. Median of Two Sorted Arrays
- [leetcode]4. Median of Two Sorted Arrays
- LeetCode-4.Median of Two Sorted Arrays
- [LeetCode]4. Median of Two Sorted Arrays
- leetCode 4. Median of Two Sorted Arrays
- Leetcode 4. Median of Two Sorted Arrays
- 百度测试开发--一面(技术)
- Keystore的相关用法
- 《Effective Java》读书笔记(二)之对于所有对象都通用的方法
- 原生JS获取单选框或复选框的选中值的方法
- session作用域
- 【LeetCode】4. Median of Two Sorted Arrays
- C语言学习:非局部跳转setjmp.h中的几个重要函数
- 最大堆树状打印
- "我"与AI
- 由传感器传入、树莓派修改MySQL数据
- ElasticSearch集群服务器配置
- SSD6 Exercise 1: Decoding Lab
- keystore案例
- Elasticsearch分布式搜索集群配置