This repository has been archived on 2023-12-13. You can view files and clone it, but cannot push or open issues or pull requests.
advent-of-code-2022/day4/src/main.rs
2022-12-05 10:48:05 -05:00

67 lines
1.8 KiB
Rust

#[derive(Debug, PartialEq, PartialOrd)]
struct Range {
low: u32,
high: u32,
}
impl From<&str> for Range {
fn from(s: &str) -> Self {
let parts: Vec<&str> = s.split("-").collect();
let low: u32 = parts[0].parse().unwrap();
let high: u32 = parts[1].parse().unwrap();
Range { low, high }
}
}
impl Range {
fn contains(&self, other: &Range) -> bool {
self.low <= other.low && self.high >= other.high
|| other.low <= self.low && other.high >= self.high
}
fn overlap(&self, other: &Range) -> bool {
let range_a = self.low..=self.high;
let range_b = other.low..=other.high;
range_a.contains(&other.low)
|| range_a.contains(&other.high)
|| range_b.contains(&self.low)
|| range_b.contains(&self.high)
}
}
// ----------------------------------------------------------------------------
fn parse_ranges(line: &str) -> (Range, Range) {
let ranges: Vec<&str> = line.split(',').collect();
let range_a = Range::from(ranges[0]);
let range_b = Range::from(ranges[1]);
(range_a, range_b)
}
fn main() {
let file_str = include_str!("input.txt");
let count = file_str
.lines()
.map(|line| parse_ranges(line))
.map(|(range_a, range_b)| range_a.contains(&range_b))
.filter(|contains| *contains == true)
.collect::<Vec<bool>>()
.len();
let overlap_count = file_str
.lines()
.map(|line| parse_ranges(line))
.map(|(range_a, range_b)| range_a.overlap(&range_b))
.filter(|contains| *contains == true)
.collect::<Vec<bool>>()
.len();
println!("Part 1: fully contained pairs: {}", count);
println!("Part 2: overlapping pairs: {}", overlap_count);
}