Compare commits
9 commits
8e1ff94001
...
35c23272cb
Author | SHA1 | Date | |
---|---|---|---|
35c23272cb | |||
b48c5eb39f | |||
8145a3087c | |||
f69ff1ffd7 | |||
187bf3d466 | |||
0b36da038e | |||
3caa7018f8 | |||
361de986ee | |||
2807b4b478 |
4 changed files with 133 additions and 12 deletions
|
@ -33,23 +33,24 @@ fn main() {
|
|||
let leny = frfrvec.clone().len();
|
||||
|
||||
for y in 1..leny {
|
||||
let widthup = y - 1 > 4;
|
||||
let widthdown = (leny - y) > 4;
|
||||
let widthup = y >= 4;
|
||||
let widthdown = (leny - y) >= 4;
|
||||
|
||||
for x in 1..lenx {
|
||||
for x in 1..lenx+1 {
|
||||
// check if enough space left and right
|
||||
println!("x is {x}");
|
||||
println!("y is {y}");
|
||||
println!("width up: {}", widthup);
|
||||
println!("width down: {}", widthdown);
|
||||
let widthleft = x - 1 > 4;
|
||||
println!("width left: {}", widthleft);
|
||||
let widthright = (lenx - x) > 4;
|
||||
println!("width right: {}", widthright);
|
||||
|
||||
let widthleft = x >= 4;
|
||||
|
||||
let widthright = (lenx - x) >= 3;
|
||||
|
||||
// search algorithm starts here
|
||||
// check if the char is s
|
||||
// check if the char is X
|
||||
if frfrvec[y][x] == 'X' {
|
||||
println!("x is {x}");
|
||||
println!("y is {y}");
|
||||
println!("width up: {}", widthup);
|
||||
println!("width down: {}", widthdown);
|
||||
println!("width left: {}", widthleft);
|
||||
// check if going upwards
|
||||
if widthup {
|
||||
if frfrvec[y - 1][x] == 'M'
|
||||
|
@ -57,6 +58,7 @@ fn main() {
|
|||
&& frfrvec[y - 3][x] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful up");
|
||||
}
|
||||
}
|
||||
// check if going diag up left
|
||||
|
@ -66,6 +68,7 @@ fn main() {
|
|||
&& frfrvec[y - 3][x - 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful up left");
|
||||
}
|
||||
}
|
||||
// check if going left
|
||||
|
@ -75,6 +78,7 @@ fn main() {
|
|||
&& frfrvec[y][x - 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful left");
|
||||
}
|
||||
}
|
||||
// check if going diag down left
|
||||
|
@ -84,6 +88,7 @@ fn main() {
|
|||
&& frfrvec[y + 3][x - 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful down left");
|
||||
}
|
||||
}
|
||||
// check if going down
|
||||
|
@ -93,6 +98,7 @@ fn main() {
|
|||
&& frfrvec[y + 3][x] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful down");
|
||||
}
|
||||
}
|
||||
// check if going diag down right
|
||||
|
@ -102,6 +108,7 @@ fn main() {
|
|||
&& frfrvec[y + 3][x + 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful down right");
|
||||
}
|
||||
}
|
||||
// check if going right
|
||||
|
@ -111,6 +118,7 @@ fn main() {
|
|||
&& frfrvec[y][x + 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful right");
|
||||
}
|
||||
}
|
||||
// check if going diag right up
|
||||
|
@ -120,9 +128,11 @@ fn main() {
|
|||
&& frfrvec[y - 3][x + 3] == 'S'
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful up right");
|
||||
}
|
||||
}
|
||||
}
|
||||
println!("\n")
|
||||
}
|
||||
}
|
||||
|
||||
|
|
7
2024/day4/part2/Cargo.lock
generated
Normal file
7
2024/day4/part2/Cargo.lock
generated
Normal file
|
@ -0,0 +1,7 @@
|
|||
# This file is automatically @generated by Cargo.
|
||||
# It is not intended for manual editing.
|
||||
version = 3
|
||||
|
||||
[[package]]
|
||||
name = "part1"
|
||||
version = "0.1.0"
|
6
2024/day4/part2/Cargo.toml
Normal file
6
2024/day4/part2/Cargo.toml
Normal file
|
@ -0,0 +1,6 @@
|
|||
[package]
|
||||
name = "part1"
|
||||
version = "0.1.0"
|
||||
edition = "2021"
|
||||
|
||||
[dependencies]
|
98
2024/day4/part2/src/main.rs
Normal file
98
2024/day4/part2/src/main.rs
Normal file
|
@ -0,0 +1,98 @@
|
|||
use std::fs::read_to_string;
|
||||
|
||||
fn main() {
|
||||
let mut pointcounter = 0;
|
||||
|
||||
let lines: Vec<String> = read_to_string("input.txt")
|
||||
.unwrap()
|
||||
.lines()
|
||||
.map(String::from)
|
||||
.collect();
|
||||
let mut frfrvec: Vec<Vec<char>> = Vec::new();
|
||||
println!("ye the lines are {:?}", lines);
|
||||
|
||||
// make y coord offset by 1
|
||||
let lenxold = lines[1].chars().count();
|
||||
let mut lenvec: Vec<char> = Vec::new();
|
||||
for i in 0..lenxold {
|
||||
lenvec.push('0');
|
||||
}
|
||||
frfrvec.push(lenvec);
|
||||
|
||||
// main section where you push stuff
|
||||
for ministr in lines.clone() {
|
||||
let mut pushvec = Vec::new();
|
||||
pushvec.push('0'); // make x coord offset by 1
|
||||
for minichar in ministr.chars() {
|
||||
pushvec.push(minichar);
|
||||
}
|
||||
frfrvec.push(pushvec);
|
||||
}
|
||||
println!("{:?}", frfrvec);
|
||||
let lenx = lines[1].chars().count();
|
||||
let leny = frfrvec.clone().len();
|
||||
|
||||
for y in 1..leny {
|
||||
let widthup = y >= 2;
|
||||
let widthdown = (leny - y) >= 2;
|
||||
|
||||
for x in 1..lenx+1 {
|
||||
// check if enough space left and right
|
||||
|
||||
let widthleft = x >= 2;
|
||||
|
||||
let widthright = (lenx - x) >= 1;
|
||||
|
||||
// search algorithm starts here
|
||||
// check if the char is X
|
||||
if frfrvec[y][x] == 'A' {
|
||||
println!("x is {x}");
|
||||
println!("y is {y}");
|
||||
println!("width up: {}", widthup);
|
||||
println!("width down: {}", widthdown);
|
||||
println!("width left: {}", widthleft);
|
||||
if widthup && widthleft && widthdown && widthright {
|
||||
// check if start from top
|
||||
if frfrvec[y - 1][x - 1] == 'M' // up left
|
||||
&& frfrvec[y - 1][x + 1] == 'M' // up right
|
||||
&& frfrvec[y + 1][x - 1] == 'S' // down left
|
||||
&& frfrvec[y + 1][x + 1] == 'S' // down right
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful up");
|
||||
}
|
||||
// check if start from left
|
||||
if frfrvec[y - 1][x - 1] == 'M' // up left
|
||||
&& frfrvec[y - 1][x + 1] == 'S' // up right
|
||||
&& frfrvec[y + 1][x - 1] == 'M' // down left
|
||||
&& frfrvec[y + 1][x + 1] == 'S' // down right
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful left");
|
||||
}
|
||||
// check if start from bottom
|
||||
if frfrvec[y - 1][x - 1] == 'S' // up left
|
||||
&& frfrvec[y - 1][x + 1] == 'S' // up right
|
||||
&& frfrvec[y + 1][x - 1] == 'M' // down left
|
||||
&& frfrvec[y + 1][x + 1] == 'M' // down right
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful down");
|
||||
}
|
||||
// check if start from right
|
||||
if frfrvec[y - 1][x - 1] == 'S' // up left
|
||||
&& frfrvec[y - 1][x + 1] == 'M' // up right
|
||||
&& frfrvec[y + 1][x - 1] == 'S' // down left
|
||||
&& frfrvec[y + 1][x + 1] == 'M' // down right
|
||||
{
|
||||
pointcounter += 1;
|
||||
println!("successful right");
|
||||
}
|
||||
}
|
||||
}
|
||||
println!("\n")
|
||||
}
|
||||
}
|
||||
|
||||
println!("{pointcounter}");
|
||||
}
|
Loading…
Reference in a new issue