fluffy/adventOfCode2024
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

part 4 complete

Browse source
This commit is contained in:
Seth Samuel 2025-04-28 23:19:46 +00:00
parent f902e5f6b3
commit 2dd81df725
2 changed files with 33 additions and 25 deletions
Download patch file Download diff file Expand all files Collapse all files

56
4/index.js
View file

@ -1,6 +1,6 @@
const fs = require("fs");
const forwardRegex = /XMAS/g;
const backwardRegex = /SAMX/g;
const forwardRegex = /XMAS/;
const backwardRegex = /SAMX/;
const input = fs.readFileSync("input.txt", "utf-8");
const inputArr = input.split("\n");
let totalMatches = 0;
@ -10,18 +10,21 @@ let totalMatches = 0;
// console.log(forwardMatchs.length)
//create a sliding window to match the words
// for (row of inputArr) {
// // console.log(row)
// const forwardMatches = row.match(forwardRegex);
// const backwordsMatches = row.match(backwardRegex);
let lineRegex = 0;
for (row of inputArr) {
// console.log(row)
const forwardMatches = row.match(forwardRegex);
const backwordsMatches = row.match(backwardRegex);
// if (forwardMatches) {
// totalMatches += forwardMatches.length;
// }
// if (backwordsMatches) {
// totalMatches += backwordsMatches.length;
// }
// }
if (forwardMatches) {
lineRegex += forwardMatches.length;
}
if (backwordsMatches) {
lineRegex += backwordsMatches.length;
}
}
console.log("lineRegex: ",lineRegex)
// console.log(inputArr)
const maxRows = inputArr.length;
@ -29,41 +32,46 @@ const maxLetters = inputArr[0].length;
//horizontal words
for (let x = 0; x < maxRows; x++) {
for (let y = 0; y + 3 <= maxLetters; y++) {
for (let y = 0; y + 3 < maxLetters; y++) {
const word = inputArr[x][y] + inputArr[x][y + 1] + inputArr[x][y + 2] + inputArr[x][y + 3];
if (forwardRegex.test(word) || backwardRegex.test(word)) {
// console.log(word)
if (word.match(forwardRegex)|| word.match(backwardRegex)) {
totalMatches++;
}
}
}
console.log("after horizontal: ",totalMatches)
//vertical words
for (let x = 0; x + 3 < maxRows; x++) {
for (let y = 0; y <= maxLetters; y++) {
for (let y = 0; y < maxLetters; y++) {
const word = inputArr[x][y] + inputArr[x + 1][y] + inputArr[x + 2][y] + inputArr[x + 3][y];
if (forwardRegex.test(word) || backwardRegex.test(word)) {
if (word.match(forwardRegex)|| word.match(backwardRegex)) {
totalMatches++;
}
}
}
//angled words 1
for (let x = 0; x + 4 < maxRows; x++) {
console.log("after vertical: ",totalMatches)
//angled words nw-se
for (let x = 0; x + 3 < maxRows; x++) {
for (let y = 0; y +3< maxLetters; y++) {
const word = inputArr[x][y] + inputArr[x + 1][y + 1] + inputArr[x + 2][y + 2] + inputArr[x + 3][y + 3];
if (forwardRegex.test(word) || backwardRegex.test(word)) {
if (word.match(forwardRegex)|| word.match(backwardRegex)) {
totalMatches++;
}
}
}
//angled words 2
for (let x = 0; x + 4 < maxRows; x++) {
console.log("after nw-se: ",totalMatches)
//angled words ne-sw
for (let x = 0; x + 3 < maxRows; x++) {
for (let y = 0; y +3< maxLetters; y++) {
const word = inputArr[x][y+3] + inputArr[x+1][y + 2] + inputArr[x + 2][y + 1] + inputArr[x+3][y];
if (forwardRegex.test(word) || backwardRegex.test(word)) {
if (word.match(forwardRegex)|| word.match(backwardRegex)) {
totalMatches++;
}
console.log(word);
// console.log(word);
}
}
console.log("after ne-sw: ",totalMatches)
console.log("totalMatches: ", totalMatches);