Compare commits
1 Commits
assignment
...
assignment
| Author | SHA1 | Date | |
|---|---|---|---|
| 28597a3f26 |
17
README.md
17
README.md
@@ -1,13 +1,8 @@
|
||||
# Advent of Code 2022 - Assignment5 javascript
|
||||
This repository contains answers to the assignments of Advent of Coding 2022
|
||||
# Advent of Code 2022 - Assignment8 javascript
|
||||
## Description
|
||||
This problem is all about walking through a grid. In this solution, we look through an entire column and row until we find a node with height <= height.
|
||||
|
||||
## References
|
||||
- https://www.w3schools.com/jsref/jsref_includes.asp
|
||||
- https://stackoverflow.com/questions/10261986/how-to-detect-string-which-contains-only-spaces
|
||||
- https://www.w3schools.com/jsref/jsref_indexof.asp
|
||||
- https://stackoverflow.com/questions/8073673/how-can-i-add-new-array-elements-at-the-beginning-of-an-array-in-javascript
|
||||
- https://stackoverflow.com/questions/966225/how-can-i-create-a-two-dimensional-array-in-javascript
|
||||
- https://www.w3schools.com/jsref/jsref_ceil.asp
|
||||
- https://stackoverflow.com/questions/30561056/console-log-a-multi-dimensional-array
|
||||
- https://teamtreehouse.com/community/removing-more-than-1-element-using-pop-and-shift-method
|
||||
- https://stackoverflow.com/questions/14723848/push-multiple-elements-to-array
|
||||
- https://www.w3schools.com/jsref/jsref_charat.asp
|
||||
- https://stackabuse.com/javascript-check-if-variable-is-a-number/
|
||||
- https://www.w3schools.com/jsref/jsref_abs.asp
|
||||
@@ -8,8 +8,8 @@
|
||||
<body>
|
||||
<p>Assignment:</p>
|
||||
<textarea rows="15" cols="50" id="assignment"></textarea>
|
||||
<input type="checkbox" id="algorithm"/>
|
||||
<label for="algorithm">All containers at once?</label>
|
||||
<input type="checkbox" id="algorithm" />
|
||||
<label for="algorithm">Highest scenic score?</label>
|
||||
|
||||
<p>Answer:</p>
|
||||
<div id="answer">Provide input first</div>
|
||||
|
||||
213
script.js
213
script.js
@@ -1,18 +1,14 @@
|
||||
const ASSIGNMENT = 'assignment';
|
||||
const ANSWER = 'answer';
|
||||
const ALGORITHM_CHECKBOX = 'algorithm';
|
||||
const CONTAINER_NULL_CHARACTER=0;
|
||||
const INSTRUCTION_FROM='from';
|
||||
const INSTRUCTION_MOVE='move';
|
||||
const INSTRUCTION_TO='to';
|
||||
const NEWLINE_CHARACTER = '\n';
|
||||
|
||||
/**
|
||||
* Main function
|
||||
*/
|
||||
window.onload = function() {
|
||||
document.getElementById(ASSIGNMENT).addEventListener("input", calculateAnswer);
|
||||
document.getElementById(ALGORITHM_CHECKBOX).addEventListener("click", calculateAnswer);
|
||||
window.onload = function () {
|
||||
document.getElementById(ASSIGNMENT).addEventListener("input", calculateAnswer);
|
||||
document.getElementById(ALGORITHM_CHECKBOX).addEventListener("click", calculateAnswer);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -22,8 +18,8 @@ window.onload = function() {
|
||||
function calculateAnswer(event) {
|
||||
console.info("Calculating answer for input...");
|
||||
let assignment = document.getElementById(ASSIGNMENT).value;
|
||||
let allAtOnce = document.getElementById(ALGORITHM_CHECKBOX).checked;
|
||||
let answer = algorithm(assignment, allAtOnce);
|
||||
let getHighestScenicScore = document.getElementById(ALGORITHM_CHECKBOX).checked;
|
||||
let answer = algorithm(assignment, getHighestScenicScore);
|
||||
|
||||
document.getElementById(ANSWER).innerText = answer;
|
||||
}
|
||||
@@ -31,137 +27,108 @@ function calculateAnswer(event) {
|
||||
/**
|
||||
* Calculate the answer to assignment.
|
||||
* @param assignment the input from the assignment.
|
||||
* @param allAtOnce should all containers be moved at once.
|
||||
* @return string the answer
|
||||
*/
|
||||
function algorithm(assignment, allAtOnce) {
|
||||
let lines = assignment.split(NEWLINE_CHARACTER);
|
||||
let containerPlan = Array.from({length:(lines[0].length+1)/4}, () => [])
|
||||
console.info("Linecount:" + lines.length);
|
||||
function algorithm(assignment, getHighestScenicScore) {
|
||||
let lines = assignment.trim().split(NEWLINE_CHARACTER);
|
||||
console.info("Linecount:" + lines.length);
|
||||
|
||||
let parsec = true;
|
||||
for(let i=0; i<lines.length; i++) {
|
||||
if(parsec) {
|
||||
let visibleTreeCount = 0;
|
||||
let highestScenicScore = 0;
|
||||
|
||||
// Parse containers
|
||||
let containerLine = lines[i];
|
||||
for (let i = 0; i < lines.length; i++) {
|
||||
let row = lines[i].trim();
|
||||
|
||||
// Skip numbers
|
||||
if(containerLine[1] == '1') {
|
||||
parsec = false;
|
||||
i+=1;
|
||||
console.table(containerPlan);
|
||||
continue;
|
||||
}
|
||||
for (let j = 0; j < row.length; j++) {
|
||||
if (i <= 0 || i >= lines.length - 1 || j <= 0 || j >= row.length - 1) { // Edge node
|
||||
//console.debug("Edge node found.");
|
||||
visibleTreeCount++;
|
||||
continue;
|
||||
}
|
||||
|
||||
let containers = parseContainers(containerLine);
|
||||
if(containers == -1) {
|
||||
// invalid containerline
|
||||
// TODO: error
|
||||
console.error("Container parse failure.");
|
||||
continue;
|
||||
}
|
||||
let height = parseInt(lines[i].charAt(j));
|
||||
if (!walkRowVisible(height, j, row) && !walkColumnVisible(height, i, j, lines)) {
|
||||
console.log("Found invisible tree, height:" + height + ", i:" + i + ", j:" + j);
|
||||
visibleTreeCount--;
|
||||
}
|
||||
|
||||
// Add containers
|
||||
//console.debug(containers);
|
||||
for(let j=0; j<containers.length; j++) {
|
||||
let container = containers[j];
|
||||
//console.debug(container);
|
||||
if(container != CONTAINER_NULL_CHARACTER) {
|
||||
//console.debug(j);
|
||||
//console.debug(containerPlan);
|
||||
containerPlan[j].push(container);
|
||||
}
|
||||
}
|
||||
//console.table(containerPlan);
|
||||
} else {
|
||||
// Parse instructions
|
||||
let instructionLine = lines[i];
|
||||
let instruction = parseInstruction(instructionLine);
|
||||
|
||||
console.debug(instruction);
|
||||
if(instruction == -1) {
|
||||
// invalid instructionline
|
||||
// TODO: error
|
||||
console.error("Instruction parse failure.");
|
||||
continue;
|
||||
}
|
||||
|
||||
// Execute instruction
|
||||
let movecount=0;
|
||||
if(allAtOnce) {
|
||||
while(instruction.move > 0) {
|
||||
let container = containerPlan[instruction.from].shift();
|
||||
containerPlan[instruction.to].unshift(container);
|
||||
instruction.move--;
|
||||
movecount++;
|
||||
}
|
||||
console.debug("moved:" + movecount);
|
||||
} else {
|
||||
let splicedContainers = containerPlan[instruction.from].splice(0, instruction.move);
|
||||
containerPlan[instruction.to].unshift(...splicedContainers);
|
||||
}
|
||||
|
||||
//console.table(containerPlan);
|
||||
if (getHighestScenicScore) {
|
||||
let scenicScore = walkRowCount(height, j, row) * walkColumnCount(height, i, j, lines);
|
||||
if (scenicScore > highestScenicScore) {
|
||||
console.debug("Found new highest scenic score: " + scenicScore);
|
||||
highestScenicScore = scenicScore;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
let result="";
|
||||
for(let k=0; k<containerPlan.length; k++) {
|
||||
result += containerPlan[k][0];
|
||||
// Tree is on edge.
|
||||
visibleTreeCount++;
|
||||
}
|
||||
}
|
||||
|
||||
return "Top containers on the stack are: " + result;
|
||||
if (getHighestScenicScore) {
|
||||
return "Highest scenic score: " + highestScenicScore;
|
||||
}
|
||||
|
||||
return "Amount of visible trees in the grid: " + visibleTreeCount;
|
||||
}
|
||||
|
||||
function parseInstruction(instructionLine) {
|
||||
let instruction={
|
||||
move:0,
|
||||
from:0,
|
||||
to:0,
|
||||
}
|
||||
|
||||
instructionLine.replace(/\s/g, ''); // Remove whitespace
|
||||
let fromIndex = instructionLine.indexOf(INSTRUCTION_FROM);
|
||||
let moveIndex = instructionLine.indexOf(INSTRUCTION_MOVE);
|
||||
let toIndex = instructionLine.indexOf(INSTRUCTION_TO);
|
||||
|
||||
// Validate
|
||||
if(fromIndex < 0 || moveIndex < 0 || toIndex < 0) {
|
||||
// Error
|
||||
return -1;
|
||||
}
|
||||
|
||||
// TODO validate check for numbers after indices.
|
||||
|
||||
// Parse
|
||||
instruction.move = parseInt(instructionLine.substring(moveIndex + INSTRUCTION_MOVE.length + 1, fromIndex));
|
||||
instruction.from = parseInt(instructionLine.substring(fromIndex + INSTRUCTION_FROM.length + 1, toIndex)) -1;
|
||||
instruction.to = parseInt(instructionLine.substring(toIndex + INSTRUCTION_TO.length + 1)) -1;
|
||||
|
||||
return instruction;
|
||||
function walkColumnCount(height, index, rowIndex, column) {
|
||||
return walkCount(height, index, column, false, rowIndex);
|
||||
}
|
||||
|
||||
function parseContainers(containerLine) {
|
||||
let containerLineLength = (containerLine.length+1);
|
||||
//console.debug("Parse ContainerLine, length: " + containerLineLength);
|
||||
function walkRowCount(height, index, row) {
|
||||
return walkCount(height, index, row, true, -1);
|
||||
}
|
||||
|
||||
if(!containerLine.includes('[') || !containerLine.includes(']') || containerLineLength % 4 != 0) {
|
||||
return -1;
|
||||
}
|
||||
function walkColumnVisible(height, index, rowIndex, column) {
|
||||
return walkVisible(height, index, column, false, rowIndex);
|
||||
}
|
||||
|
||||
let containers = [];
|
||||
for(let i=0; i<containerLineLength; i+=4) {
|
||||
let containerLineSubString = containerLine.substring(i, i+4).trim();
|
||||
let character = containerLineSubString[1];
|
||||
if(containerLineSubString[0] != '[' || containerLineSubString[2] != ']') {
|
||||
// Warning invalid container format
|
||||
// TODO: warning
|
||||
}
|
||||
function walkRowVisible(height, index, row) {
|
||||
return walkVisible(height, index, row, true, -1);
|
||||
}
|
||||
|
||||
containers.push((!character)? CONTAINER_NULL_CHARACTER: character);
|
||||
}
|
||||
//console.debug(containers);
|
||||
function walkCount(height, index, line, isRow, rowIndex) {
|
||||
let visibleLeftCount = __walkHelper(height, index, line, isRow, -1, rowIndex, 0);
|
||||
let visibleRightCount = __walkHelper(height, index, line, isRow, 1, rowIndex, 0);
|
||||
|
||||
return containers;
|
||||
return visibleLeftCount * visibleRightCount;
|
||||
}
|
||||
|
||||
function walkVisible(height, index, line, isRow, rowIndex) {
|
||||
let visibleLeft = __walkHelper(height, index, line, isRow, -1, rowIndex);
|
||||
let visibleRight = __walkHelper(height, index, line, isRow, 1, rowIndex);
|
||||
|
||||
return visibleLeft || visibleRight;
|
||||
}
|
||||
|
||||
function __walkHelper(height, index, line, isRow, direction, rowIndex, count) {
|
||||
if (direction == 0) {
|
||||
console.error("Invalid direction 0 in __walkhelper");
|
||||
return -1;
|
||||
}
|
||||
|
||||
direction = direction / Math.abs(direction);
|
||||
|
||||
// Edge reached
|
||||
if ((direction < 0 && index <= 0) || (direction > 0 && index >= line.length - 1)) {
|
||||
return (count == undefined) ? true : count;
|
||||
}
|
||||
|
||||
let nextIndex = index + direction;
|
||||
let nextHeightCharacter = (isRow) ? line.charAt(nextIndex) : line[nextIndex].trim().charAt(rowIndex);
|
||||
let nextHeight = parseInt(nextHeightCharacter);
|
||||
|
||||
if (isNaN(height) || isNaN(nextHeightCharacter)) {
|
||||
console.error("Invalid height found, height:" + height + ", nextHeight: " + nextHeightCharacter);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (height <= nextHeight) {
|
||||
if (count == undefined)
|
||||
return false;
|
||||
return count + 1;
|
||||
}
|
||||
|
||||
return __walkHelper(height, nextIndex, line, isRow, direction, rowIndex, (count !=undefined)? count + 1 : undefined);
|
||||
}
|
||||
Reference in New Issue
Block a user