dan
/
advent_of_code
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

split each day into a sub module

This commit is contained in:
Dan Ballard 2020-12-06 17:02:00 -08:00
parent 474680a2d7
commit 8d760a131d
4 changed files with 90 additions and 87 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
src/aoc01/mod.rs Normal file
View File

@ -0,0 +1,35 @@
use std::fs::File;
use std::io::{prelude::*, BufReader};
use std::error::Error;
pub fn both(filename: &str) -> Result<(), Box<dyn Error>> {
let file = File::open(filename).expect("No file");
let br = BufReader::new(file);
let mut v: Vec<i64> = vec![];
for line in br.lines() {
v.push(line?
.trim()
.parse().unwrap());
}
for i in 0..v.len()-2 {
for j in i+1..v.len()-1 {
if v[i] + v[j] == 2020 {
println!("aoc_01_01 result: {}", v[i]*v[j]);
}
}
}
for i in 0..v.len()-3 {
for j in i+1..v.len()-2 {
for k in j+1..v.len()-1 {
if v[i] + v[j] + v[k] == 2020 {
println!("aoc_01_02 result: {}", v[i] * v[j] * v[k]);
}
}
}
}
return Ok(());
}

51
src/aoc02/mod.rs Normal file
View File

@ -0,0 +1,51 @@
use std::fs;
use std::error::Error;
use regex::Regex;
pub fn both(filename: &str) -> Result<(), Box<dyn Error>> {
let contents = fs::read_to_string(filename)?;
let pairs: Vec<Vec<String>> = contents.lines().map(|line| {
line.split(":").map(|s| String::from(s)).collect()
}).collect();
aoc_02_01(&pairs).unwrap();
aoc_02_02(&pairs).unwrap();
Ok(())
}
fn aoc_02_01(pairs: &Vec<Vec<String>>) -> Result<(), Box<dyn Error>> {
let mut valid = 0;
let rules_re = Regex::new(r"(\d*)-(\d*) ([a-z])").unwrap();
for i in 0..pairs.len() {
let rule = rules_re.captures(&pairs[i][0]).unwrap();
let min = rule[1].parse::<usize>().unwrap();
let max = rule[2].parse::<usize>().unwrap();
let matches: usize = pairs[i][1].matches(&rule[3]).count();
if matches >= min && matches <= max {
valid += 1;
}
}
println!("2_1 had {}/{} valid passwords", valid, pairs.len());
return Ok(());
}
fn aoc_02_02(pairs: &Vec<Vec<String>>) -> Result<(), Box<dyn Error>> {
let mut valid = 0;
let rules_re = Regex::new(r"(\d*)-(\d*) ([a-z])").unwrap();
for i in 0..pairs.len() {
let rule = rules_re.captures(&pairs[i][0]).unwrap();
let first = rule[1].parse::<usize>().unwrap();
let sec = rule[2].parse::<usize>().unwrap();
// the indexes are 1 based but the pairs[x][2] has a leading space so it works out... -_-;
let m1 = pairs[i][1].as_bytes()[first] == rule[3].as_bytes()[0];
let m2 = pairs[i][1].as_bytes()[sec] == rule[3].as_bytes()[0];
if (m1 || m2) && !(m1 && m2) {
valid += 1;
}
}
println!("2_2 had {}/{} valid passwords", valid, pairs.len());
return Ok(());
}

87
src/lib.rs
View File

@ -1,85 +1,2 @@
use std::fs;
use std::fs::File;
use std::io::{prelude::*, BufReader};
use std::error::Error;
use regex::Regex;
pub fn aoc_01_both(filename: &str) -> Result<(), Box<dyn Error>> {
let file = File::open(filename).expect("No file");
let br = BufReader::new(file);
let mut v: Vec<i64> = vec![];
for line in br.lines() {
v.push(line?
.trim()
.parse().unwrap());
}
for i in 0..v.len()-2 {
for j in i+1..v.len()-1 {
if v[i] + v[j] == 2020 {
println!("aoc_01_01 result: {}", v[i]*v[j]);
}
}
}
for i in 0..v.len()-3 {
for j in i+1..v.len()-2 {
for k in j+1..v.len()-1 {
if v[i] + v[j] + v[k] == 2020 {
println!("aoc_01_02 result: {}", v[i] * v[j] * v[k]);
}
}
}
}
return Ok(());
}
pub fn aoc_02(filename: &str) -> Result<(), Box<dyn Error>> {
let contents = fs::read_to_string(filename)?;
let pairs: Vec<Vec<String>> = contents.lines().map(|line| {
line.split(":").map(|s| String::from(s)).collect()
}).collect();
aoc_02_01(&pairs).unwrap();
aoc_02_02(&pairs).unwrap();
Ok(())
}
fn aoc_02_01(pairs: &Vec<Vec<String>>) -> Result<(), Box<dyn Error>> {
let mut valid = 0;
let rules_re = Regex::new(r"(\d*)-(\d*) ([a-z])").unwrap();
for i in 0..pairs.len() {
let rule = rules_re.captures(&pairs[i][0]).unwrap();
let min = rule[1].parse::<usize>().unwrap();
let max = rule[2].parse::<usize>().unwrap();
let matches: usize = pairs[i][1].matches(&rule[3]).count();
if matches >= min && matches <= max {
valid += 1;
}
}
println!("2_1 had {}/{} valid passwords", valid, pairs.len());
return Ok(());
}
fn aoc_02_02(pairs: &Vec<Vec<String>>) -> Result<(), Box<dyn Error>> {
let mut valid = 0;
let rules_re = Regex::new(r"(\d*)-(\d*) ([a-z])").unwrap();
for i in 0..pairs.len() {
let rule = rules_re.captures(&pairs[i][0]).unwrap();
let first = rule[1].parse::<usize>().unwrap();
let sec = rule[2].parse::<usize>().unwrap();
// the indexes are 1 based but the pairs[x][2] has a leading space so it works out... -_-;
let m1 = pairs[i][1].as_bytes()[first] == rule[3].as_bytes()[0];
let m2 = pairs[i][1].as_bytes()[sec] == rule[3].as_bytes()[0];
if (m1 || m2) && !(m1 && m2) {
valid += 1;
}
}
println!("2_2 had {}/{} valid passwords", valid, pairs.len());
return Ok(());
}
pub mod aoc01;
pub mod aoc02;

4
src/main.rs
View File

@ -7,8 +7,8 @@ fn main() {
};
let result = match day {
1 => advent_of_code::aoc_01_both("./inputs/01-01.txt"),
2 => advent_of_code::aoc_02("./inputs/02-01.txt"),
1 => advent_of_code::aoc01::both("./inputs/01-01.txt"),
2 => advent_of_code::aoc02::both("./inputs/02-01.txt"),
_ => Err(format!("unsupported day {}", day).into()),
};