-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path03.rs
64 lines (55 loc) · 1.72 KB
/
03.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
57
58
59
60
61
62
63
64
use std::collections::HashMap;
use advent_of_code::input::input_03::{parse_input, EnginePart, Symbol};
advent_of_code::solution!(3);
pub fn part_one(input: &str) -> Option<u32> {
let (parts, symbols) = parse_input(input, r"(\+|-|\*|/|=|\$|@|%|#|&)");
parts
.iter()
.filter_map(|part| part.neighboring_symbol(&symbols).map(|_| part.number))
.reduce(|acc, number| acc + number)
}
pub fn part_two(input: &str) -> Option<u32> {
let (parts, symbols) = parse_input(input, r"\*");
parts
.iter()
.map(|part| (part.neighboring_symbol(&symbols), part))
.filter_map(|(symbol, part)| symbol.map(|s| (s, part)))
// Group by neighboring symbol
.fold(
HashMap::new(),
|mut acc: HashMap<Symbol, Vec<&EnginePart>>, (symbol, part)| {
acc.entry(symbol).or_default().push(part);
acc
},
)
.iter()
.filter_map(|(_, parts)| {
if parts.len() == 2 {
return Some(parts);
}
None
})
// Calculate gear ratio
.map(|parts| {
parts
.iter()
.map(|part| part.number)
.reduce(|acc, number| acc * number)
.unwrap()
})
.reduce(|acc, gear_ratio| acc + gear_ratio)
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_part_one() {
let result = part_one(&advent_of_code::template::read_file("examples", DAY));
assert_eq!(result, Some(4361));
}
#[test]
fn test_part_two() {
let result = part_two(&advent_of_code::template::read_file("examples", DAY));
assert_eq!(result, Some(467835));
}
}