Assignment on my birthday

2022-12-06 17:26:38 +01:00
4 changed files with 36 additions and 120 deletions
--- a/README.md
+++ b/README.md
@@ -1,6 +1,5 @@
-# Advent of Code 2022 - Assignment7 javascript
-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.
+# Advent of Code 2022 - Assignment6_javascript
+This repository contains answers to the assignments of Advent of Coding 2022

 ## References
- 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
+- https://stackoverflow.com/questions/28207610/checking-if-the-characters-in-a-string-are-all-unique
--- a/index.html
+++ b/index.html
@@ -8,7 +8,9 @@
  <body>
    <p>Assignment:</p>
    <textarea rows="15" cols="50" id="assignment"></textarea>
-
+    <input type="checkbox" id="algorithm" />
+    <label for="algorithm">Search for message marker?</label>
+    
    <p>Answer:</p>
    <div id="answer">Provide input first</div>
    <script src="script.js"></script>
--- a/script.js
+++ b/script.js
@@ -1,85 +1,16 @@
 const ASSIGNMENT = 'assignment';
 const ANSWER = 'answer';
+const ALGORITHM_CHECKBOX = 'algorithm';
+const MARKER_DISTINCT_CHARACTERS = 4;
+const MESSAGE_DISTINCT_CHARACTERS = 14;
 const NEWLINE_CHARACTER = '\n';
-const MAX_SIZE = 100000;
-const UPDATE_SIZE = 30000000;
-const TOTAL_SPACE = 70000000;

 /**
 * Main function
 */
 window.onload = function() {
-    document.getElementById(ASSIGNMENT).addEventListener("input", 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;
-  }
+  document.getElementById(ASSIGNMENT).addEventListener("input", calculateAnswer);
+  document.getElementById(ALGORITHM_CHECKBOX).addEventListener("click", calculateAnswer);
 }

 /**
@@ -88,7 +19,9 @@ class TreeNode {
 */
 function calculateAnswer(event) {
  console.info("Calculating answer for input...");
-  let answer = algorithm(event.target.value);
+  let assignment = document.getElementById(ASSIGNMENT).value;
+  let distinctCharacters = (document.getElementById(ALGORITHM_CHECKBOX).checked)? MESSAGE_DISTINCT_CHARACTERS: MARKER_DISTINCT_CHARACTERS;
+  let answer = algorithm(assignment, distinctCharacters);

  document.getElementById(ANSWER).innerText = answer;
 }
@@ -98,50 +31,28 @@ function calculateAnswer(event) {
 * @param assignment the input from the assignment.
 * @return string the answer
 */
-function algorithm(assignment) {
-  let lines = assignment.trim().split(NEWLINE_CHARACTER);
-  console.info("Linecount:" + lines.length);
+function algorithm(assignment, distinctCharacters) {
+    let signal = assignment.trim();
+    let marker = assignment.substring(0,distinctCharacters);

-  let root = new TreeNode('/');
-  let currentdir = root;
-
-  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;
+    for(let i=distinctCharacters; i<signal.length; i++) {
+      if(containsDistinctCharacters(marker)) {
+        console.debug("Found marker after:" + i + " characters");
+        return "Marker found after processing: " + i + " characters.";
      }

-      if(changeDirectory == "/") {
-        currentdir = root;
-        continue;
-      }
-
-      if(!currentdir.contains(changeDirectory)) {
-        currentdir.descendants.push(new TreeNode(changeDirectory, currentdir));
-      } 
-
-      currentdir = currentdir.getDir(changeDirectory);
-    } else if(terminalLine.substring(0, 3) != 'dir' && !terminalLine.includes('$')) {
-      console.debug(terminalLine);
-      spaceIndex = terminalLine.indexOf(' ');
-      size = parseInt(terminalLine.substring(0, spaceIndex));
-      currentdir.increaseSize(size);
+      marker = marker.substring(1, distinctCharacters) + assignment[i];
    }
-  }

-  let freeDiskSpace = TOTAL_SPACE - root.size;
-  console.debug("Free disk space: " + freeDiskSpace);
+    return "No marker found.";
+}

-  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);
+/**
+ * Check if string only contains distinct characters.
+ * @param String string the string to check
+ * @return true, if string contains only distinct characters
+ */
+function containsDistinctCharacters(string) {
+  console.debug("Check marker: " + string);
+  return new Set(string).size == string.length;
 }
--- a/style.css
+++ b/style.css
@@ -6,6 +6,10 @@ body {
    font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, Oxygen, Ubuntu, Cantarell, 'Open Sans', 'Helvetica Neue', sans-serif;
  }
  
+  textarea {
+    display: block;
+  }
+  
  #answer {
    color: purple
  }