leetcode - Median of Two Sorted Arrays
来源:互联网 发布:情义知多少 编辑:程序博客网 时间:2024/04/18 11:45
There are two sorted arrays A and B 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)).
class Solution {public: int findKth(int A[], int m, int B[], int n, int k) { int l = k - 1 - std::min(k - 1, n), r = std::min(k, m); while (l <= r) { int i = l + ((r - l) >> 1); int j = k - 1 - i; if (i >= 0 && i < m && (j >= n || A[i] <= B[j]) && (j == 0 || B[j-1] <= A[i])) return A[i]; else if (j >= 0 && j < n && (i >= m || B[j] <= A[i]) && (i == 0 || A[i-1] <= B[j])) return B[j]; if (j >= n || A[i] < B[j]) l = i + 1; else r = i - 1; } } double findMedianSortedArrays(int A[], int m, int B[], int n) { if ((m + n) & 1) return findKth(A, m, B, n, ((m + n) >> 1) + 1); else return (findKth(A, m, B, n, (m + n) >> 1) + findKth(A, m, B, n, ((m + n) >> 1) + 1)) * 0.5; }};
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
- 10/25联通面试,移动笔试,毕设
- Android开发系列(十八):自定义控件样式在drawable文件夹下的XML实现
- 将图片设置为背景颜色
- 2014后半年计划
- 设置圆角
- leetcode - Median of Two Sorted Arrays
- JFreeChart 使用一 饼图之高级特性
- 计算内容的文字的size
- hdu 5073 Galaxy
- android开发环境搭建及环境变量的配置
- 动态计算行高
- Leetcode: Find Minimum in Rotated Sorted Array
- 黑马程序员——java中的反射
- VC中判断定时器是否已经开启的办法