refactor

src/2024/day19.js

@@ -1,4 +1,4 @@
-function countMatches(line, patterns, memo = {}) {
+function countMatches(line, patterns, memo) {
   let matches = 0;
   if (line in memo) return memo[line];
   if (line.length === 0) return 1;
@@ -7,26 +7,24 @@ function countMatches(line, patterns, memo = {}) {
       matches += countMatches(line.slice(pattern.length), patterns, memo);
     }
   }
-  memo[line] = matches;
-  return matches;
+  return (memo[line] = matches);
 }
 
-export function part1(input) {
+function solve(input) {
   let [patterns, lines] = input.split("\n\n");
   patterns = patterns.split(", ");
-  let matches = 0;
+  let matches = [];
+  let memo = {};
   for (let line of lines.split("\n")) {
-    if (countMatches(line, patterns)) matches++;
+    matches.push(countMatches(line, patterns, memo));
   }
   return matches;
 }
 
+export function part1(input) {
+  return solve(input).filter(x => x > 0).length;
+}
+
 export function part2(input) {
-  let [patterns, lines] = input.split("\n\n");
-  patterns = patterns.split(", ");
-  let matches = 0;
-  for (let line of lines.split("\n")) {
-    matches += countMatches(line, patterns);
-  }
-  return matches;
+  return solve(input).reduce((a, b) => a + b);
 }