-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeInterval.java
More file actions
55 lines (49 loc) · 1.46 KB
/
MergeInterval.java
File metadata and controls
55 lines (49 loc) · 1.46 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
import java.util.Arrays;
import java.util.Comparator;
/**
* @description:
* @Author: JachinDo
* @Date: 2019/11/02 13:01
*/
public class MergeInterval {
public int[][] merge(int[][] intervals) {
int len = intervals.length;
if (len == 0 || len == 1) {
return intervals;
}
Arrays.sort(intervals, new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
return o1[0] - o2[0];
}
});
int[][] res = new int[len][2];
int left = intervals[0][0];
int right = intervals[0][1];
int index = 0;
int resLen = len;
for (int i = 1; i < len; i++) {
if (intervals[i][0] <= right) {
if (intervals[i][1] > right) {
right = intervals[i][1];
}
if (i == len - 1) {
res[index][0] = left;
res[index][1] = right;
}
resLen--;
} else {
res[index][0] = left;
res[index][1] = right;
index++;
left = intervals[i][0];
right = intervals[i][1];
if (i == len - 1) {
res[index][0] = left;
res[index][1] = right;
}
}
}
return Arrays.copyOfRange(res, 0, resLen); // 左区间闭，右区间开
}
}