2025-03-29 21:23:32 -04:00
|
|
|
use crate::Solution;
|
2025-03-29 22:08:18 -04:00
|
|
|
use std::fs;
|
|
|
|
|
use std::process;
|
2025-03-29 21:23:32 -04:00
|
|
|
|
|
|
|
|
pub fn run_day_4() -> Solution {
|
2025-03-29 22:08:18 -04:00
|
|
|
let file = fs::read_to_string("./inputs/day4test.txt").expect("Unable to parse file");
|
|
|
|
|
let search_map = build_search_map(&file);
|
|
|
|
|
// @here you are Dan
|
|
|
|
|
// this is now creating a vector which you can iterator over
|
|
|
|
|
// will need to work out logic to go through each letter
|
|
|
|
|
// and detect if it is part of a match or now
|
|
|
|
|
// somehow keeping track of past matches
|
|
|
|
|
// need to do in all directions and backwards
|
|
|
|
|
// this is...complicated.
|
|
|
|
|
dbg!(search_map[0][2]);
|
2025-03-29 21:23:32 -04:00
|
|
|
|
2025-03-29 22:08:18 -04:00
|
|
|
// Return the solution
|
2025-03-29 21:23:32 -04:00
|
|
|
let solution = Solution {
|
|
|
|
|
day: 4,
|
|
|
|
|
answer_1: "test".to_string(),
|
|
|
|
|
answer_2: "another".to_string(),
|
|
|
|
|
};
|
|
|
|
|
solution
|
2025-03-29 22:08:18 -04:00
|
|
|
}
|
2025-03-29 21:23:32 -04:00
|
|
|
|
2025-03-29 22:08:18 -04:00
|
|
|
fn build_search_map(row: &str) -> Vec<Vec<char>> {
|
|
|
|
|
let mut search_map: Vec<Vec<char>> = vec!();
|
|
|
|
|
for line in row.lines() {
|
|
|
|
|
let char_vec: Vec<char> = line_to_chars(&line);
|
|
|
|
|
search_map.push(char_vec.clone());
|
|
|
|
|
}
|
|
|
|
|
search_map
|
2025-03-29 21:23:32 -04:00
|
|
|
}
|
2025-03-29 22:08:18 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
fn line_to_chars(row_line: &str) -> Vec<char> {
|
|
|
|
|
row_line.chars().collect()
|
|
|
|
|
}
|
|
|
|
|
|