-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathScaleTest.java
More file actions
65 lines (59 loc) · 2.31 KB
/
Copy pathScaleTest.java
File metadata and controls
65 lines (59 loc) · 2.31 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
60
61
62
63
64
65
package AlgorithmTest;
import java.util.ArrayList;
import java.util.List;
/*
* 给出一个区间的集合，请合并所有重叠的区间。
* 输入: [[1,3],[2,6],[8,10],[15,18]]
* 输出: [[1,6],[8,10],[15,18]]
* 解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6]
* */
class Interval {
int start;
int end;
Interval() { start = 0; end = 0; }
Interval(int s, int e) { start = s; end = e; }
@Override
public String toString() {
return start+","+end;
}
}
public class ScaleTest {
public static void main(String[] args) {
List<Interval> intervals=new ArrayList<>();
intervals.add(new Interval(1,1));
intervals.add(new Interval(1,1));
// intervals.add(new Interval(8,10));
// intervals.add(new Interval(15,18));
merg(intervals);
}
public static List<Interval> merg(List<Interval> intervals){
List<Interval> result=new ArrayList<>();
if( intervals.get(0).end<intervals.get(1).end&&intervals.get(0).end>intervals.get(1).start){
result.add(new Interval( intervals.get(0).start,intervals.get(1).end));
}else if(intervals.get(0).end==intervals.get(1).end&&intervals.get(0).end==intervals.get(1).start){
result.add(intervals.get(0));
}else{
result.add(intervals.get(0));
result.add(intervals.get(1));
}
for(int i=2;i<intervals.size();i++) {
if (result.size() == 0) {
if (intervals.get(0).end < intervals.get(1).end && intervals.get(0).end > intervals.get(1).start) {
result.add(new Interval(intervals.get(0).start, intervals.get(1).end));
} else {
result.add(intervals.get(0));
result.add(intervals.get(1));
}
} else {
if (intervals.get(i).end < result.get(result.size() - 1).end && intervals.get(i).end > result.get(result.size() - 1).start) {
result.add(new Interval(result.get(result.size() - 1).start, intervals.get(i).end));
result.remove(result.size() - 2);//移除之前末尾
}else{
result.add(intervals.get(i));
}
}
}
System.out.println(result);
return result;
}
}