-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathInsertInterval.java
More file actions
63 lines (58 loc) · 1.87 KB
/
InsertInterval.java
File metadata and controls
63 lines (58 loc) · 1.87 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
import java.util.*;
class Interval {
int start;
int end;
Interval() { start = 0; end = 0; }
Interval(int s, int e) { start = s; end = e; }
}
public class Solution {
public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
int i = 0;
List<Interval> result = new ArrayList<Interval>();
if (intervals.size() == 0) {
result.add(newInterval);
return result;
}
if (newInterval.start > intervals.get(intervals.size()-1).end) {
intervals.add(newInterval);
return intervals;
}
if (newInterval.end < intervals.get(0).start) {
intervals.add(0, newInterval);
return intervals;
}
while (i < intervals.size()) {
if (newInterval.start > intervals.get(i).end) {
result.add(intervals.get(i));
i += 1;
} else {
break;
}
}
int new_start = Math.min(newInterval.start, intervals.get(i).start);
int new_end = newInterval.end;
while (i < intervals.size()) {
if (newInterval.end >= intervals.get(i).start) {
new_end = Math.max(new_end, intervals.get(i).end);
i += 1;
} else {
break;
}
}
Interval insert = new Interval(new_start, new_end);
result.add(insert);
while (i < intervals.size()) {
result.add(intervals.get(i));
i += 1;
}
return result;
}
public static void main(String[] args) {
Solution s = new Solution();
Interval i0 = new Interval(1, 5);
List<Interval> intervals = new ArrayList<Interval>();
intervals.add(i0);
Interval newInterval = new Interval(2, 3);
s.insert(intervals, newInterval);
}
}