|
| 1 | +use std::fs::read_to_string; |
| 2 | + |
| 3 | +pub struct Day01 { |
| 4 | + pub input_file: String, |
| 5 | + first_list: Vec<i64>, |
| 6 | + second_list: Vec<i64>, |
| 7 | +} |
| 8 | + |
| 9 | +impl Day01 { |
| 10 | + pub fn new(input_file: String) -> Day01 { |
| 11 | + let mut day01: Day01 = Day01 { |
| 12 | + input_file: input_file, |
| 13 | + first_list: Vec::new(), |
| 14 | + second_list: Vec::new(), |
| 15 | + }; |
| 16 | + day01.open_input(); |
| 17 | + day01 |
| 18 | + } |
| 19 | + fn open_input(&mut self) { |
| 20 | + for line in read_to_string(self.input_file.clone()).unwrap().lines() { |
| 21 | + let values: Vec<&str> = line.split_whitespace().collect(); |
| 22 | + self.first_list.push(values[0].parse().unwrap()); |
| 23 | + self.second_list.push(values[1].parse().unwrap()); |
| 24 | + } |
| 25 | + } |
| 26 | + pub fn part1(&self) -> i64 { |
| 27 | + let mut sorted_first_list: Vec<i64> = self.first_list.clone(); |
| 28 | + let mut sorted_second_list: Vec<i64> = self.second_list.clone(); |
| 29 | + sorted_first_list.sort(); |
| 30 | + sorted_second_list.sort(); |
| 31 | + let mut result: i64 = 0; |
| 32 | + let len = sorted_first_list.len(); |
| 33 | + for i in 0..len { |
| 34 | + let distance: i64 = sorted_first_list[i] - sorted_second_list[i]; |
| 35 | + result += distance.abs(); |
| 36 | + } |
| 37 | + result |
| 38 | + } |
| 39 | + |
| 40 | + pub fn part2(&self) -> i64 { |
| 41 | + 23 |
| 42 | + } |
| 43 | +} |
| 44 | + |
| 45 | +#[cfg(test)] |
| 46 | +mod tests { |
| 47 | + use super::*; |
| 48 | + |
| 49 | + #[test] |
| 50 | + fn result_part1() { |
| 51 | + let day01: Day01 = Day01::new(String::from("/workspaces/advent-of-code-2024/input_examples/day01.txt")); |
| 52 | + let result = day01.part1(); |
| 53 | + assert_eq!(result, 11); |
| 54 | + } |
| 55 | + |
| 56 | + #[test] |
| 57 | + fn result_part2() { |
| 58 | + let day01: Day01 = Day01::new(String::from("input_examples/day01.txt")); |
| 59 | + assert_eq!(day01.part2(), 23); |
| 60 | + } |
| 61 | +} |
0 commit comments