-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaximumConsecutiveGap.java
More file actions
59 lines (48 loc) · 1.78 KB
/
maximumConsecutiveGap.java
File metadata and controls
59 lines (48 loc) · 1.78 KB
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
50
51
52
53
54
55
56
57
58
59
import java.util.*;
class maximumConsecutiveGap{
public static void main(String[] args){
int arr[] = new int[]{9, 7, 0, 2, 12, 1, 17};
System.out.println("Maximum difference will be:"+maxSortedAdjacentDiff(arr));
}
static int maxSortedAdjacentDiff(int[] arr) {
int max = arr[0],n=arr.length;
int minVal = arr[0];
for (int i = 1; i < n; i++) {
max = Math.max(max, arr[i]);
minVal = Math.min(minVal, arr[i]);
}
int maxB[] = new int[n - 1];
int minB[] = new int[n - 1];
Arrays.fill(maxB, 0, n - 1, Integer.MIN_VALUE);
Arrays.fill(minB, 0, n - 1, Integer.MAX_VALUE);
float delta = (float) (max - minVal) / (float) (n - 1);
int Prev = minVal;
int maxGap = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == max || arr[i] == minVal) {
continue;
}
int index = (int) (Math.round((arr[i] - minVal) / delta));
// System.out.println("index ="+index+" for element="+arr[i]);
if (maxB[index] == Integer.MIN_VALUE) {
maxB[index] = arr[i];
} else {
maxB[index] = Math.max(maxB[index], arr[i]);
}
if (minB[index] == Integer.MAX_VALUE) {
minB[index] = arr[i];
} else {
minB[index] = Math.min(minB[index], arr[i]);
}
}
for (int i = 0; i < n - 1; i++) {
if (minB[i] == Integer.MAX_VALUE) {
continue;
}
maxGap = Math.max(maxGap, minB[i] - Prev);
Prev = maxB[i];
}
maxGap = Math.max(maxGap, max - Prev);
return maxGap;
}
}