-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMarge Intervals.java
More file actions
45 lines (38 loc) · 1.28 KB
/
Copy pathMarge Intervals.java
File metadata and controls
45 lines (38 loc) · 1.28 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
import java.util.* ;
import java.io.*;
/*******************************************************
Following is the Interval class structure
class Interval {
int start, int finish;
Interval(int start, int finish) {
this.start = start;
this.finish = finish;
}
}
*******************************************************/
import java.util.List;
import java.util.ArrayList;
public class Solution {
public static List<Interval> mergeIntervals(Interval[] intervals) {
// write your code here.
List<Interval> ans = new ArrayList<>();
Arrays.sort(intervals,(a,b)->{
return a.start==b.start ? a.finish-b.finish : a.start - b.start;
});
Integer start = intervals[0].start;
Integer end = intervals[0].finish;
for(Interval i : intervals){
if((i.start>=start && i.start<=end) || (i.finish>=start && i.finish <= end) ){
start = Math.min(start,i.start);
end = Math.max(end,i.finish);
}
else{
ans.add(new Interval(start,end));
start = i.start;
end = i.finish;
}
}
ans.add(new Interval(start,end));
return ans;
}
}