MatthiasQuintern/AdventOfCode2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

rm redundant code

Browse Source
This commit is contained in:
matthias@arch 2023-12-13 16:28:07 +01:00
parent a08c047178
commit 756f0fa9a0
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
10/day10.rs
View File

@ -33,8 +33,6 @@ impl std::fmt::Display for Pos {
} }
fn follow(tiles: &mut Vec<Vec<u8>>, start: &Pos, mut direction: u8) -> Option<usize> { fn follow(tiles: &mut Vec<Vec<u8>>, start: &Pos, mut direction: u8) -> Option<usize> {
let xlen: usize = tiles[0].len(); // assume all are same size
let ylen: usize = tiles.len();
let mut steps: usize = 0; let mut steps: usize = 0;
let mut current = *start; let mut current = *start;
// mark the start tile as loop tile and with its directions // mark the start tile as loop tile and with its directions
@ -124,12 +122,10 @@ fn main() {
}).collect()); }).collect());
} }
let mut distance: usize = 0; let mut distance: usize = 0;
let mut num_tiles: usize = 0;
for direction in [N, S, E, W] { for direction in [N, S, E, W] {
println!("Starting at ({},{})", start_pos.x, start_pos.y); println!("Starting at ({},{})", start_pos.x, start_pos.y);
if let Some(steps) = follow(&mut tiles, &start_pos, direction) { if let Some(steps) = follow(&mut tiles, &start_pos, direction) {
assert!(steps % 2 == 0, "steps={} not even", steps); assert!(steps % 2 == 0, "steps={} not even", steps);
num_tiles = steps;
distance = steps / 2; distance = steps / 2;
break; break;
} }