You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
172 lines
4.1 KiB
Rust
172 lines
4.1 KiB
Rust
|
|
/******************************************************************************
|
|
* @file day_1.rs
|
|
* @author Joey Pollack
|
|
* @date 2024/12/03 (y/m/d)
|
|
* @modified 2024/12/03 (y/m/d)
|
|
* @copyright Joseph R Pollack
|
|
* @brief Advent of Code 2024 day 1 problems
|
|
******************************************************************************/
|
|
|
|
use ::solver_base::solver_base::{Solver, DataSet, RunMode};
|
|
use utils::utils;
|
|
|
|
pub struct Day1
|
|
{
|
|
data_set: DataSet,
|
|
run_mode: RunMode,
|
|
do_debug_prints: bool,
|
|
data_a: Vec<i32>,
|
|
data_b: Vec<i32>,
|
|
distances: Vec<i32>,
|
|
pub final_result: i32,
|
|
}
|
|
|
|
//|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
// DAY 1 IMPL
|
|
//|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
impl Day1
|
|
{
|
|
pub fn new() -> Day1
|
|
{
|
|
Day1 { data_set: DataSet::Test, run_mode: RunMode::FirstCase, do_debug_prints: false, data_a: vec![], data_b: vec![], distances: vec![], final_result: 0 }
|
|
}
|
|
|
|
fn solve_first_case(self: &mut Self) -> String
|
|
{
|
|
// iterate the lists and find the differences
|
|
for i in 0..self.data_a.len()
|
|
{
|
|
self.distances.push((self.data_a[i] - self.data_b[i]).abs());
|
|
}
|
|
|
|
if self.do_debug_prints
|
|
{
|
|
println!("Day1 Debug: distances: {:#?}", self.distances);
|
|
}
|
|
|
|
// iterate the list of differences and sum them
|
|
self.final_result = self.distances.iter().sum::<i32>();
|
|
self.final_result.to_string()
|
|
}
|
|
|
|
fn solve_second_case(self: &mut Self) -> String
|
|
{
|
|
|
|
// need to find the largest number in either set
|
|
let largest_a = *self.data_a.iter().max().unwrap();
|
|
let largest_b = *self.data_b.iter().max().unwrap();
|
|
let largest = largest_a.max(largest_b) + 1;
|
|
|
|
if self.do_debug_prints
|
|
{
|
|
println!("Day1 Debug: Largest value found: {}", largest - 1);
|
|
}
|
|
|
|
|
|
// count the occurance of each value in set b
|
|
let mut num_occurrences: Vec<i32> = vec![0; largest as usize];
|
|
for i in 0..self.data_b.len()
|
|
{
|
|
num_occurrences[self.data_b[i] as usize] += 1;
|
|
}
|
|
|
|
if self.do_debug_prints
|
|
{
|
|
println!("Day1 Debug: Number of ID occurances: {:#?}", num_occurrences);
|
|
}
|
|
|
|
// find the similarity score
|
|
let mut sim_score = 0;
|
|
for d in self.data_a.clone()
|
|
{
|
|
sim_score += num_occurrences[d as usize] * d;
|
|
}
|
|
|
|
self.final_result = sim_score;
|
|
self.final_result.to_string()
|
|
}
|
|
}
|
|
|
|
//|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
// SOLVER TRAIT IMPL
|
|
//|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
impl Solver for Day1
|
|
{
|
|
fn print_test()
|
|
{
|
|
println!("DAY 1 TEST PRINT");
|
|
// solver_base::print_test();
|
|
|
|
let dir = utils::get_working_dir();
|
|
let data = utils::load_data(&format!("{}/data/TESTING", dir));
|
|
println!("DATA: {}", data);
|
|
}
|
|
|
|
fn init(self: &mut Self, data_set: DataSet, run_mode: RunMode, enable_debug_prints: bool)
|
|
{
|
|
self.data_set = data_set;
|
|
self.run_mode = run_mode;
|
|
self.do_debug_prints = enable_debug_prints;
|
|
|
|
let dir = utils::get_working_dir();
|
|
let data_filename =
|
|
match self.data_set
|
|
{
|
|
DataSet::Test => format!("{}/data/day1_test_input", dir),
|
|
DataSet::TestAlt => panic!("Day 1: There is no TestAlt input file!"), //format!("{}/data/day2_test_input", dir),
|
|
DataSet::Full => format!("{}/data/day1_input", dir),
|
|
};
|
|
|
|
|
|
let data = utils::load_data(&data_filename);
|
|
|
|
// Split the data and convert to i32 values
|
|
let data: Vec<i32> = data.split_ascii_whitespace().map(|x| x.parse::<i32>().unwrap()).collect();
|
|
|
|
// Split by column
|
|
for (i, d) in data.iter().enumerate()
|
|
{
|
|
// if i is even
|
|
if i % 2 < 1
|
|
{
|
|
self.data_a.push(*d)
|
|
}
|
|
else
|
|
{
|
|
self.data_b.push(*d);
|
|
}
|
|
}
|
|
|
|
self.data_a.sort();
|
|
self.data_b.sort();
|
|
|
|
if self.data_a.len() != self.data_b.len()
|
|
{
|
|
panic!("Day 1 ERROR: Data set lengths do NOT match: data_a.len(): {}, data_b.len(): {}", self.data_a.len(), self.data_b.len());
|
|
}
|
|
|
|
if self.do_debug_prints
|
|
{
|
|
println!("Day1 Debug: Input data processed:\n\tdata_a: {:#?}\n\tdata_b: {:#?}", self.data_a, self.data_b);
|
|
}
|
|
|
|
}
|
|
|
|
fn solve(self: &mut Self) -> String
|
|
{
|
|
match self.run_mode
|
|
{
|
|
RunMode::FirstCase =>
|
|
{
|
|
self.solve_first_case()
|
|
},
|
|
|
|
RunMode::SecondCase =>
|
|
{
|
|
self.solve_second_case()
|
|
}
|
|
}
|
|
}
|
|
|
|
} |