forked from architsingla13/InterviewBit-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArray3Pointers.java
More file actions
43 lines (33 loc) · 1000 Bytes
/
Array3Pointers.java
File metadata and controls
43 lines (33 loc) · 1000 Bytes
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
package TwoPointers;
import java.util.List;
/**
* Author - archit.s
* Date - 16/10/18
* Time - 12:44 PM
*/
public class Array3Pointers {
public int minimize(final List<Integer> A, final List<Integer> B, final List<Integer> C) {
int i=0;
int j=0;
int k=0;
int min_diff = Math.abs(Math.max(A.get(i), Math.max(B.get(j), C.get(k))) - Math.min(A.get(i), Math.min(B.get(j), C.get(k))));
while(i<A.size() && j<B.size() && k<C.size()){
int max = Math.max(A.get(i), Math.max(B.get(j), C.get(k)));
int min = Math.min(A.get(i), Math.min(B.get(j), C.get(k)));
int current = Math.abs(max - min);
if(current < min_diff){
min_diff = current;
}
if(min == A.get(i)){
i++;
}
else if(min == B.get(j)){
j++;
}
else{
k++;
}
}
return min_diff;
}
}