alarsyo/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

2020: day06: cleanup

Browse source
This commit is contained in:
Antoine Martin 2020-12-06 13:02:21 +01:00
parent 60715cad1a
commit 62d5e5b6c0
1 changed files with 19 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

35
aoc2020/src/day06.rs
View file

@ -41,12 +41,7 @@ fn part1(input: &str) -> aoc::Result<usize> {
Ok(groups
.iter()
.map(|group| {
group.answers.iter().fold(HashSet::new(), |set, answers| {
set.union(answers).copied().collect()
})
})
.map(|set| set.len())
.map(|group| group.unique_positive_answers().len())
.sum())
}
@ -55,16 +50,7 @@ fn part2(input: &str) -> aoc::Result<usize> {
Ok(groups
.iter()
.map(|group| {
group
.answers
.iter()
.skip(1)
.fold(group.answers[0].clone(), |set, answers| {
set.intersection(answers).copied().collect()
})
})
.map(|set| set.len())
.map(|group| group.common_positive_answers().len())
.sum())
}
@ -72,6 +58,23 @@ struct Group {
answers: Vec<HashSet<u8>>,
}
impl Group {
fn unique_positive_answers(&self) -> HashSet<u8> {
self.answers.iter().fold(HashSet::new(), |set, answers| {
set.union(answers).copied().collect()
})
}
fn common_positive_answers(&self) -> HashSet<u8> {
self.answers
.iter()
.skip(1)
.fold(self.answers[0].clone(), |set, answers| {
set.intersection(answers).copied().collect()
})
}
}
#[cfg(test)]
mod tests {
use super::*;