-
Notifications
You must be signed in to change notification settings - Fork 288
/
AC_binary_search_logn.java
49 lines (42 loc) · 1.63 KB
/
AC_binary_search_logn.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/*
* Author: illuz <iilluzen[at]gmail.com>
* File: AC_binary_search_logn.java
* Create Date: 2015-02-02 22:54:43
* Descripton:
*/
import java.util.Scanner;
public class Solution {
private double findKthSortedArrays(int A[], int astart, int aend,
int B[], int bstart, int bend, int k) {
int m = aend - astart, n = bend - bstart;
if (m < n) {
return findKthSortedArrays(B, bstart, bend, A, astart, aend, k);
}
if (n == 0)
return A[astart + k - 1];
if (k == 1)
return Math.min(A[astart], B[bstart]);
int pb = Math.min(k / 2, n), pa = k - pb;
if (A[astart + pa - 1] > B[bstart + pb - 1])
return findKthSortedArrays(A, astart, aend, B, bstart + pb, bend, k - pb);
else if (A[astart + pa - 1] < B[bstart + pb - 1])
return findKthSortedArrays(A, astart + pa, aend, B, bstart, bend, k - pa);
else
return A[astart + pa - 1];
}
public double findMedianSortedArrays(int A[], int B[]) {
int m = A.length, n = B.length;
if ((n + m) % 2 == 1)
return findKthSortedArrays(A, 0, m, B, 0, n, (n + m) / 2 + 1);
else
return (findKthSortedArrays(A, 0, m, B, 0, n, (n + m) / 2 + 1) +
findKthSortedArrays(A, 0, m, B, 0, n, (n + m) / 2)) / 2.0;
}
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
Solution s = new Solution();
int A[] = {1, 2, 4};
int B[] = {3, 5, 6};
System.out.println(s.findMedianSortedArrays(A, B));
}
}