tabby/advent-of-code-2025
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

solid start i think

Browse source
This commit is contained in:
Tabby 2025-12-02 05:59:10 +00:00
parent d835e286f7
commit e89d7fcddc
1 changed files with 16 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

19
aoc-2/src/main.rs
View file

@ -23,13 +23,26 @@ fn main() {
// let mut results = vec![]; // let mut results = vec![];
// parse the provided ranges into paits // parse the provided ranges into paits
let ranges: Vec<(i32, i32)> = re.captures_iter(&line).map(|caps| { let ranges: Vec<(&str, &str)> = re.captures_iter(&line).map(|caps| {
let start: i32 = caps.name("start_range").unwrap().as_str().parse::<i32>().unwrap(); let start = caps.name("start_range").unwrap().as_str();
let end: i32 = caps.name("end_range").unwrap().as_str().parse::<i32>().unwrap(); let end = caps.name("end_range").unwrap().as_str();
(start, end) (start, end)
}).collect(); }).collect();
println!("{ranges:?}"); println!("{ranges:?}");
for range in ranges{
println!("working on: {range:?}");
let start = range.0.parse::<i64>().unwrap();
let end = range.1.parse::<i64>().unwrap();
// println!("{range.0:?} --> {end}");
let mut count :i64 = start;
while count <= end{
// if odd number of didgits, then no match, skip to next loop
// if even number, then compare the first and second half
count += 1;
}
}
} }