-
Notifications
You must be signed in to change notification settings - Fork 2
/
MergeIntervals.java
49 lines (37 loc) · 1.08 KB
/
MergeIntervals.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
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class MergeIntervals {
static void merge(int[][] intervals) {
Arrays.sort(intervals, (a, b) -> Integer.compare(a[0], b[0]));
LinkedList<int[]> merged = new LinkedList<>();
for (int[] interval : intervals) {
if (merged.isEmpty() || merged.getLast()[1] < interval[0]) {
merged.add(interval);
}else {
merged.getLast()[1] = Math.max(merged.getLast()[1], interval[1]);
}
}
intervals=merged.toArray(new int[merged.size()][]);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s=new Scanner(System.in);
int n;
n=s.nextInt();
int [][] arr= new int[n][2];
for (int i = 0; i < n; i++) {
for(int j=0;j<2;j++) {
arr[i][j]=s.nextInt();
}
}
merge(arr);
for (int i = 0; i < n; i++) {
if(i>0 && arr[i][1]==arr[i-1][1]) {
continue;
}
System.out.println(arr[i][0]+" "+arr[i][1]);
}
s.close();
}
}