generated from fspoettel/advent-of-code-rust
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path01.rs
67 lines (51 loc) · 1.53 KB
/
01.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
65
66
67
use std::collections::HashMap;
advent_of_code::solution!(1);
pub fn part_one(input: &str) -> Option<u32> {
let (mut left, mut right) = parse_input(input);
left.sort();
right.sort();
let sum = left.iter().zip(right).map(|(a, b)| a.abs_diff(b)).sum();
Some(sum)
}
pub fn part_two(input: &str) -> Option<u32> {
let (left, right) = parse_input(input);
let mut seen_ids = HashMap::new();
let sum = left
.iter()
.map(|id| {
let count = seen_ids
.entry(id)
.or_insert_with(|| count_occurences(id, &right));
*id * *count
})
.sum();
Some(sum)
}
fn count_occurences(id: &u32, list: &Vec<u32>) -> u32 {
list.iter().filter(|value| **value == *id).count() as u32
}
fn parse_input(input: &str) -> (Vec<u32>, Vec<u32>) {
let lines = input.lines();
let mut left_list = vec![];
let mut right_list = vec![];
for line in lines {
let mut split = line.split(" ");
left_list.push(split.next().unwrap().parse::<u32>().unwrap());
right_list.push(split.next().unwrap().parse::<u32>().unwrap());
}
(left_list, right_list)
}
#[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(11));
}
#[test]
fn test_part_two() {
let result = part_two(&advent_of_code::template::read_file("examples", DAY));
assert_eq!(result, Some(31));
}
}