leetcode-rust/src/leetcode/problem/erase_overlap_intervals.rs at main · martwz/leetcode-rust · GitHub

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
// 435. Non-overlapping Intervals, Medium
// https://leetcode.com/problems/non-overlapping-intervals/
impl Solution {
    pub fn erase_overlap_intervals(mut intervals: Vec<Vec<i32>>) -> i32 {
        intervals.sort_by(|a, b| a[1].cmp(&b[1]));

        let mut rms = 0;
        let mut prev = 0;

        for i in 1..intervals.len() {
            if intervals[prev][1] > intervals[i][0] {
                rms += 1;
            } else {
                prev = i;
            }
        }

        rms
    }
}

struct Solution {}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::vec_vec_i32;

    #[test]
    fn test_erase_overlap_intervals() {
        assert_eq!(Solution::erase_overlap_intervals(vec_vec_i32![[1, 2], [2, 3], [3, 4], [1, 3]]), 1);
    }

    #[test]
    fn test_erase_overlap_intervals2() {
        assert_eq!(Solution::erase_overlap_intervals(vec_vec_i32![[1, 2], [1, 2], [1, 2]]), 2);
    }

    #[test]
    fn test_erase_overlap_intervals3() {
        assert_eq!(Solution::erase_overlap_intervals(vec_vec_i32![[1, 2], [2, 3]]), 0);
    }
}