1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
use crate::input::Input;
use std::cmp::Ordering;
fn parse_input(input_string: &str) -> Result<(i32, i32), String> {
let (from_str, to_str) = input_string
.trim()
.split_once('-')
.ok_or_else(|| "Invalid parts - should be in FROM-TO form".to_string())?;
let from = from_str.parse::<i32>().or(Err("Invalid range"))?;
let to = to_str.parse::<i32>().or(Err("Invalid range"))?;
Ok((from, to))
}
pub fn solve(input: &mut Input) -> Result<u32, String> {
let (from, to) = parse_input(input.text)?;
let mut meeting_criteria_count: u32 = 0;
'outer: for i in from..=to {
let mut divider = 1;
let mut last_digit = 10;
let mut two_digits_adjacent = false;
let mut digits_adjacent_streak = 1;
while divider <= 100_000 {
let digit = (i / divider) % 10;
match digit.cmp(&last_digit) {
Ordering::Greater => {
continue 'outer;
}
Ordering::Equal => {
if input.is_part_one() {
two_digits_adjacent = true;
} else {
digits_adjacent_streak += 1;
}
}
Ordering::Less => {
if digits_adjacent_streak == 2 {
two_digits_adjacent = true;
}
digits_adjacent_streak = 1;
}
}
last_digit = digit;
divider *= 10;
}
if digits_adjacent_streak == 2 {
two_digits_adjacent = true;
}
if two_digits_adjacent {
meeting_criteria_count += 1;
}
}
Ok(meeting_criteria_count)
}
#[test]
pub fn tests() {
use crate::input::{test_part_one, test_part_two};
test_part_one!("100010-100011" => 0);
test_part_one!("111110-111111" => 1);
test_part_two!("112233-112233" => 1);
test_part_two!("123444-123444" => 0);
test_part_two!("111122-111122" => 1);
let input = include_str!("day04_input.txt");
test_part_one!(input => 1675);
test_part_two!(input => 1142);
}