paulusgaming/advent-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: paulusgaming:assignment6_js
Branches Tags
paulusgaming:main paulusgaming:assignment9_js paulusgaming:assignment8_js paulusgaming:assignment7_js paulusgaming:assignment6_js paulusgaming:assignment5_js paulusgaming:assignment1_js paulusgaming:assignment4_js paulusgaming:assignment3_js paulusgaming:assignment2_js
..
compare: paulusgaming:assignment7_js
Branches Tags
paulusgaming:assignment9_js paulusgaming:assignment8_js paulusgaming:assignment7_js paulusgaming:assignment6_js paulusgaming:assignment5_js paulusgaming:assignment1_js paulusgaming:assignment4_js paulusgaming:assignment3_js paulusgaming:assignment2_js paulusgaming:main

1 Commits
assignment ... assignment

Author SHA1 Message Date
paulusgaming
0af89a72ba Messy solution. 2022-12-08 01:31:18 +01:00
4 changed files with 120 additions and 36 deletions
Expand all files Collapse all files

7
README.md
View File

@@ -1,5 +1,6 @@
# Advent of Code 2022 - Assignment6_javascript # Advent of Code 2022 - Assignment7 javascript
This repository contains answers to the assignments of Advent of Coding 2022 Assignment 7 involves parsing linux directory commands/results into a tree. The solution defines a root TreeNode first and sets it as currentdirectory. Whenever a cd command is found a new node is created if it does not exist and set to currentdir. Whenever a cd .. is found currentdirectory is set to parent. Whenever a file is found size is recursively increased for current node and parent nodes.
## References ## References
- https://stackoverflow.com/questions/28207610/checking-if-the-characters-in-a-string-are-all-unique - https://adrianmejia.com/data-structures-for-beginners-trees-binary-search-tree-tutorial/
- https://stackoverflow.com/questions/8376525/get-value-of-a-string-after-last-slash-in-javascript

2
index.html
View File

@@ -8,8 +8,6 @@
<body> <body>
<p>Assignment:</p> <p>Assignment:</p>
<textarea rows="15" cols="50" id="assignment"></textarea> <textarea rows="15" cols="50" id="assignment"></textarea>
<input type="checkbox" id="algorithm" />
<label for="algorithm">Search for message marker?</label>
<p>Answer:</p> <p>Answer:</p>
<div id="answer">Provide input first</div> <div id="answer">Provide input first</div>

137
script.js
View File

@@ -1,16 +1,85 @@
const ASSIGNMENT = 'assignment'; const ASSIGNMENT = 'assignment';
const ANSWER = 'answer'; const ANSWER = 'answer';
const ALGORITHM_CHECKBOX = 'algorithm';
const MARKER_DISTINCT_CHARACTERS = 4;
const MESSAGE_DISTINCT_CHARACTERS = 14;
const NEWLINE_CHARACTER = '\n'; const NEWLINE_CHARACTER = '\n';
const MAX_SIZE = 100000;
const UPDATE_SIZE = 30000000;
const TOTAL_SPACE = 70000000;
/** /**
* Main function * Main function
*/ */
window.onload = function() { window.onload = function() {
document.getElementById(ASSIGNMENT).addEventListener("input", calculateAnswer); document.getElementById(ASSIGNMENT).addEventListener("input", calculateAnswer);
document.getElementById(ALGORITHM_CHECKBOX).addEventListener("click", calculateAnswer); }
class TreeNode {
constructor(value, parent) {
console.debug(((!parent)?"Root ":"") + "node created: " + value);
this.parent = parent;
this.value = value;
this.size = 0;
this.descendants = [];
}
getDir = function(path) {
for(let descendant of this.descendants) {
if(descendant.value == path) {
return descendant;
}
}
}
contains = function(path) {
// Recursive case
let subPathIndex = path.indexOf('/');
let subPath = path.substring(0, subPathIndex-1);
let leftOverPath = path.substring(subPathIndex);
// Base case
if(subPath == '') {
return false;
}
for(let descendant of this.descendants) {
if(descendant.value == subPath) {
return descendant.contains(subPath);
}
}
}
findClosestNodeToSize = function(minSize) {
let closest = this;
for(let descendant of this.descendants) {
let closestDescendant = descendant.findClosestNodeToSize(minSize);
if (closestDescendant.size > minSize && closestDescendant.size < closest.size) {
console.debug("New closest:" + closestDescendant.size);
closest = closestDescendant;
}
}
return closest;
}
increaseSize = function(size) {
// TODO: Wat doen we met duplicate files?
this.size += size;
if(this.parent) {
this.parent.increaseSize(size);
}
}
getSum = function(maxSize) {
let result = (this.size < maxSize) ? this.size: 0;
for(let descendant of this.descendants) {
result += descendant.getSum(maxSize);
}
return result;
}
} }
/** /**
@@ -19,9 +88,7 @@ window.onload = function() {
*/ */
function calculateAnswer(event) { function calculateAnswer(event) {
console.info("Calculating answer for input..."); console.info("Calculating answer for input...");
let assignment = document.getElementById(ASSIGNMENT).value; let answer = algorithm(event.target.value);
let distinctCharacters = (document.getElementById(ALGORITHM_CHECKBOX).checked)? MESSAGE_DISTINCT_CHARACTERS: MARKER_DISTINCT_CHARACTERS;
let answer = algorithm(assignment, distinctCharacters);
document.getElementById(ANSWER).innerText = answer; document.getElementById(ANSWER).innerText = answer;
} }
@@ -31,28 +98,50 @@ function calculateAnswer(event) {
* @param assignment the input from the assignment. * @param assignment the input from the assignment.
* @return string the answer * @return string the answer
*/ */
function algorithm(assignment, distinctCharacters) { function algorithm(assignment) {
let signal = assignment.trim(); let lines = assignment.trim().split(NEWLINE_CHARACTER);
let marker = assignment.substring(0,distinctCharacters); console.info("Linecount:" + lines.length);
for(let i=distinctCharacters; i<signal.length; i++) { let root = new TreeNode('/');
if(containsDistinctCharacters(marker)) { let currentdir = root;
console.debug("Found marker after:" + i + " characters");
return "Marker found after processing: " + i + " characters."; for(let i=0; i<lines.length; i++) {
let terminalLine = lines[i].trim();
if(terminalLine.substring(0, 4) == "$ cd") {
let changeDirectory = terminalLine.substring(5).trim();
if(changeDirectory == "..") {
console.debug("One directory up from: " + currentdir.value);
currentdir = currentdir.parent;
console.debug("navigates to: " + currentdir.value);
continue;
} }
marker = marker.substring(1, distinctCharacters) + assignment[i]; if(changeDirectory == "/") {
currentdir = root;
continue;
} }
return "No marker found."; if(!currentdir.contains(changeDirectory)) {
currentdir.descendants.push(new TreeNode(changeDirectory, currentdir));
} }
/** currentdir = currentdir.getDir(changeDirectory);
* Check if string only contains distinct characters. } else if(terminalLine.substring(0, 3) != 'dir' && !terminalLine.includes('$')) {
* @param String string the string to check console.debug(terminalLine);
* @return true, if string contains only distinct characters spaceIndex = terminalLine.indexOf(' ');
*/ size = parseInt(terminalLine.substring(0, spaceIndex));
function containsDistinctCharacters(string) { currentdir.increaseSize(size);
console.debug("Check marker: " + string); }
return new Set(string).size == string.length; }
let freeDiskSpace = TOTAL_SPACE - root.size;
console.debug("Free disk space: " + freeDiskSpace);
console.debug("Root size:" + root.size);
console.debug("Value to find: " + (UPDATE_SIZE - freeDiskSpace));
let closestNode = root.findClosestNodeToSize(UPDATE_SIZE - freeDiskSpace);
console.debug("Closest value: " + closestNode.size);
return "Sum below maxSize " + MAX_SIZE + ": " + root.getSum(MAX_SIZE);
} }

4
style.css
View File

@@ -6,10 +6,6 @@ body {
font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, Oxygen, Ubuntu, Cantarell, 'Open Sans', 'Helvetica Neue', sans-serif; font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, Oxygen, Ubuntu, Cantarell, 'Open Sans', 'Helvetica Neue', sans-serif;
} }
textarea {
display: block;
}
#answer { #answer {
color: purple color: purple
} }