-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathinsert-interval.rs
56 lines (47 loc) · 1.52 KB
/
insert-interval.rs
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
#![allow(dead_code, unused, unused_variables)]
fn main() {}
struct Solution;
impl Solution {
pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
let mut result = vec![];
if intervals.len() == 0 {
result.push(new_interval);
return result;
}
let (mut index0, mut index1) = (new_interval[0], new_interval[1]);
if intervals[0][0] > new_interval[1] {
result.push(new_interval);
result.extend(intervals.into_iter());
return result;
}
if intervals[intervals.len() - 1][1] < new_interval[0] {
result.extend(intervals.into_iter());
result.push(new_interval);
return result;
}
let mut flag = false;
for i in intervals.into_iter() {
if i[1] < index0 {
result.push(i);
} else if i[0] > index1 {
if !flag {
result.push(vec![index0, index1]);
flag = true;
}
result.push(i);
} else {
index0 = i[0].min(index0);
index1 = i[1].max(index1);
if !flag {
result.push(vec![index0, index1]);
flag = true;
} else {
let l = result.len() - 1;
result[l][0] = index0;
result[l][1] = index1;
}
}
}
result
}
}