[LeetCode] 051: Median of Two Sorted Arrays
来源:互联网 发布:java成绩管理系统代码 编辑:程序博客网 时间:2024/06/08 18:29
[Problem]
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)).
[Solution]
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)).
[Solution]
class Solution{说明:版权所有,转载请注明出处。Coder007的博客
public:
// find the kth element of two sorted arrays
double findKth(int *A, int m, int *B, int n, int k){
// invalid k
if(k <= 0 || k > m + n)return 0;
// because i=min(k/2, m), j=k-i, so i <= j, we should make sure m <= n
if(m > n)return findKth(B, n, A, m, k);
// either A or B is empty
if(m == 0)return B[k-1];
if(n == 0)return A[k-1];
// the first of the two sorted arrays
if(k == 1)return min(A[0], B[0]);
// binary search
int i = min(k/2, m), j = k - i;
if(A[i-1] < B[j-1]){
return findKth(A+i, m-i, B, n, k-i);
}
else if(A[i-1] > B[j-1]){
return findKth(A, m, B+j, n-j, k-j);
}
else{
return A[i-1];
}
}
// find the median of two sorted arrays
double findMedianSortedArrays(int A[], int m, int B[], int n){
// Start typing your C/C++ solution below
// DO NOT write int main() function
if((m+n) % 2 == 0){
return (findKth(A, m, B, n, (m+n)/2) + findKth(A, m, B, n, (m+n)/2+1)) / 2;
}
else{
return findKth(A, m, B, n, (m+n)/2+1);
}
}
};
阅读全文
0 0
- [LeetCode] 051: Median of Two Sorted Arrays
- 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] 049: Maximum Depth of Binary Tree
- C#如何编写程序运行exe可执行文件
- java中try 和 finally中的return
- [LeetCode] 050: Maximum Subarray
- 指针的const
- [LeetCode] 051: Median of Two Sorted Arrays
- JavaSE学习之一,坚持!
- [LeetCode] 052: Merge Intervals
- [LeetCode] 053: Merge K Sorted Lists
- [LeetCode] 054: Merge Sorted Array
- [LeetCode] 055: Merge Two Sorted Lists
- 大逃亡
- Ajax和Servlet做项目时遇到的问题
- [LeetCode] 056: Minimum Depth of Binary Tree