PROBLEM DESCRIPTION
Given 2 sorted integer arrays arr1 and arr2 of the same size. Find the sum of the middle elements of two sorted arrays arr1 and arr2.
SOLUTION
This problem is similar to:
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
class Solution {
public int SumofMiddleElements(int[] arr1, int[] arr2) {
int n = arr1.length;
int l = 0; // take no elements
int r = n; // take all elements
int half = n; // half of total length, which will be n
while(l <= r){
int i = (l + r + 1)/2;
int j = half - i;
int l1 = Integer.MIN_VALUE, l2 = Integer.MIN_VALUE;
int r1 = Integer.MAX_VALUE, r2 = Integer.MAX_VALUE;
if(i-1 >= 0)
l1 = arr1[i-1];
if(i < n)
r1 = arr1[i];
if(j-1 >= 0)
l2 = arr2[j-1];
if(j < n)
r2 = arr2[j];
if(l1 <= r2 && l2 <= r1){
return Math.max(l1, l2) + Math.min(r1, r2);
}else if(l1 > r2){
r = i-1;
}else
l = i+1;
}
return -1;
}
}