Leetcode: Median of Two Sorted Arrays

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)).

2017/2/5更新：如果一定要每次扔一半，使得时间复杂度为O(log(m+n))。可以在第一个数组找前k1个，第二个数组找前k2个，使得k1+k2 == k, 分情况：

1. if A[k1] < B[k2], then A[k1]及之前的、B[k2+1]及之后的都不可能成为第k个元素，所以扔掉

2. else if A[k1] > B[k2], then A[k1+1]及之后的、 B[k2]及之前的都不可能成为第k个元素。扔掉

if (aMid < bMid) Keep [aRight + bLeft]
else Keep [bRight + aLeft]

 1 public class Solution {
 2     public double findMedianSortedArrays(int A[], int B[]) {
 3         if((A.length+B.length)%2==1)
 4             return helper(A,B,0,A.length-1,0,B.length-1,(A.length+B.length)/2+1);
 5         else
 6             return (helper(A,B,0,A.length-1,0,B.length-1,(A.length+B.length)/2)
 7                    +helper(A,B,0,A.length-1,0,B.length-1,(A.length+B.length)/2+1))/2.0;
 8     }
 9
10     private int helper(int A[], int B[], int i, int i2, int j, int j2, int k)
11     {
12         int m = i2-i+1;
13         int n = j2-j+1;
14         if(m>n)
15             return helper(B,A,j,j2,i,i2,k);
16         if(m==0)
17             return B[j+k-1]; //这是相对距离，不是相对于0，而是这轮起点j，所以决定了25行27行要减posA或posB
18         if(k==1)
19             return Math.min(A[i],B[j]);
20         int posA = Math.min(k/2,m);
21         int posB = Math.min(k-posA, n);
22
23         if(A[i+posA-1]<B[j+posB-1])
24             return helper(A,B,i+posA,i2,j,j+posB-1,k-posA);
25         else
26             return helper(A,B,i,i+posA-1,j+posB,j2,k-posB);
27     }
28 }

转载于:https://www.cnblogs.com/EdwardLiu/p/3982815.html

Leetcode: Median of Two Sorted Arrays相关推荐

LeetCode: Median of Two Sorted Arrays 解题报告
Median of Two Sorted Arrays There are two sorted arrays A and B of size m and n respectively. Find t ...
[leetcode]Median of Two Sorted Arrays @ Python
原题地址:https://oj.leetcode.com/problems/median-of-two-sorted-arrays/ 题意:There are two sorted arrays A ...
LeetCode Median of Two Sorted Arrays (DFS)
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted ...
C语言求一个数组中第k大的数,leetcode | Median of Two Sorted Arrays 寻找2个有序数组中第k大的值...
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted ...
[leetcode] Median of Two Sorted Arrays 寻找两个有序数组的中位数
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two ...
【LeetCode】004 Median of Two Sorted Arrays 两个排序数组合并后的中位数
题目:LeetCode 004 Median of Two Sorted Arrays There are two sorted arrays nums1 and nums2 of size m an ...
Kotlin实现LeetCode算法题之Median of Two Sorted Arrays
题目Median of Two Sorted Arrays(难度Hard) 方案1,数组合并&排序调用Java方法 1 import java.util.* 2 3 class Solutio ...
LeetCode刷题第二天——3Longest Substring Without repeating character 4 Median of Two Sorted Arrays...
混淆点: 子串连续子序列可以不连续知识点: HashMap: 出现问题: 1.使用unordered_map头文件时报错 #error This file requires compiler ...
Leetcode平台上的Median of Two Sorted Arrays题目用Java快排实现
Leetcode平台上的Median of Two Sorted Arrays题目,大意就是找两个已排序数组的中位数.今天先用快排的方式实现一下,代码如下: There are two sorted ...

Leetcode: Median of Two Sorted Arrays

Leetcode: Median of Two Sorted Arrays相关推荐

最新文章

热门文章