chylex/Advent-of-Code
1
0
Fork 0
mirror of https://github.com/chylex/Advent-of-Code.git synced 2025-06-01 21:34:04 +02:00
Code

Add 2020 - Day 2 - Part 2

Browse Source
This commit is contained in:
chylex 2022-02-23 02:13:06 +01:00
parent cb2c6becbf
commit f8bc38182f
Signed by: chylex
GPG Key ID: 4DE42C8F19A80548
1 changed files with 11 additions and 3 deletions

14
2020/02/main.rs
View File

@ -1,3 +1,4 @@
use std::collections::HashSet;
use std::error::Error;
use std::str::FromStr;
@ -9,8 +10,8 @@ mod utils;
fn main() -> Result<(), Box<dyn Error>> {
let lines = utils::parse_input_lines::<PasswordRule>()?;
let valid_passwords = lines.iter().filter(|x| x.is_valid()).count();
println!("Valid passwords: {}", valid_passwords);
println!("Valid passwords according to part 1 rules: {}", lines.iter().filter(|x| x.is_valid_part1()).count());
println!("Valid passwords according to part 2 rules: {}", lines.iter().filter(|x| x.is_valid_part2()).count());
Ok(())
}
@ -23,10 +24,17 @@ struct PasswordRule {
}
impl PasswordRule {
fn is_valid(&self) -> bool {
fn is_valid_part1(&self) -> bool {
let count = self.actual_password.matches(self.required_char.as_str()).count();
return count >= self.left_value && count <= self.right_value;
}
fn is_valid_part2(&self) -> bool {
let positions = self.actual_password.match_indices(self.required_char.as_str()).map(|(index, _)| index + 1).collect::<HashSet<usize>>();
let is_in_first_position = positions.contains(&self.left_value);
let is_in_second_position = positions.contains(&self.right_value);
return (is_in_first_position && !is_in_second_position) || (!is_in_first_position && is_in_second_position);
}
}
impl FromStr for PasswordRule {