20240327 Finished
This commit is contained in:
parent
e8f14948dd
commit
c2456ffe48
|
@ -85,4 +85,5 @@ mod p2617_minimum_number_of_visited_cells_in_a_grid;
|
||||||
mod p2549_count_distinct_numbers_on_board;
|
mod p2549_count_distinct_numbers_on_board;
|
||||||
mod p322_coin_change;
|
mod p322_coin_change;
|
||||||
mod p518_coin_change_ii;
|
mod p518_coin_change_ii;
|
||||||
mod p2642_design_graph_with_shortest_path_calculator;
|
mod p2642_design_graph_with_shortest_path_calculator;
|
||||||
|
mod p2580_count_ways_to_group_overlapping_ranges;
|
75
src/problem/p2580_count_ways_to_group_overlapping_ranges.rs
Normal file
75
src/problem/p2580_count_ways_to_group_overlapping_ranges.rs
Normal file
|
@ -0,0 +1,75 @@
|
||||||
|
/**
|
||||||
|
* [2580] Count Ways to Group Overlapping Ranges
|
||||||
|
*/
|
||||||
|
pub struct Solution {}
|
||||||
|
|
||||||
|
// submission codes start here
|
||||||
|
struct Range {
|
||||||
|
start: i32,
|
||||||
|
end: i32,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Solution {
|
||||||
|
pub fn count_ways(ranges: Vec<Vec<i32>>) -> i32 {
|
||||||
|
let mut ranges: Vec<Range> = ranges
|
||||||
|
.iter()
|
||||||
|
.map(|a| {
|
||||||
|
return Range {
|
||||||
|
start: a[0],
|
||||||
|
end: a[1],
|
||||||
|
};
|
||||||
|
})
|
||||||
|
.collect();
|
||||||
|
|
||||||
|
ranges.sort_unstable_by_key(|x| x.start);
|
||||||
|
|
||||||
|
let mut merged_ranges = Vec::with_capacity(ranges.len());
|
||||||
|
|
||||||
|
let mut i = 0;
|
||||||
|
let mut last: Option<&mut Range> = None;
|
||||||
|
|
||||||
|
while i < ranges.len() {
|
||||||
|
if let Some(last_range) = last {
|
||||||
|
while i < ranges.len() && last_range.end >= ranges[i].start {
|
||||||
|
last_range.end = last_range.end.max(ranges[i].end);
|
||||||
|
i += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if i >= ranges.len() {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
merged_ranges.push(Range {
|
||||||
|
start: ranges[i].start,
|
||||||
|
end: ranges[i].end,
|
||||||
|
});
|
||||||
|
last = merged_ranges.last_mut();
|
||||||
|
i += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
let mut result = 1;
|
||||||
|
|
||||||
|
for _ in 0..merged_ranges.len() as i32 {
|
||||||
|
result = result * 2 % 1_000_000_007;
|
||||||
|
}
|
||||||
|
|
||||||
|
result
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// submission codes end
|
||||||
|
|
||||||
|
#[cfg(test)]
|
||||||
|
mod tests {
|
||||||
|
use super::*;
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_2580() {
|
||||||
|
assert_eq!(2, Solution::count_ways(vec![vec![6, 10], vec![5, 15]]));
|
||||||
|
assert_eq!(
|
||||||
|
4,
|
||||||
|
Solution::count_ways(vec![vec![1, 3], vec![10, 20], vec![2, 5], vec![4, 8]])
|
||||||
|
);
|
||||||
|
}
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user