feat: solve day 19 part 1

src/main/java/com/adventofcode/flashk/day19/LinenLayout.java

@@ -0,0 +1,64 @@
+package com.adventofcode.flashk.day19;
+
+import org.apache.commons.lang3.StringUtils;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class LinenLayout {
+
+    private List<String> patterns;
+    private List<String> designs;
+
+    private Map<String,Boolean> memo = new HashMap<>();
+
+    public LinenLayout(List<String> inputs) {
+        patterns = Arrays.stream(inputs.getFirst().replace(StringUtils.SPACE, StringUtils.EMPTY).split(","))
+                .sorted(new PatternComparator())
+                .toList();
+        inputs.removeFirst();
+        inputs.removeFirst();
+        designs = inputs;
+    }
+
+    public int solveA() {
+        int result = 0;
+        for(String design : designs) {
+            if(isPossible(design)) {
+                result++;
+            }
+        }
+        return result;
+    }
+
+    private boolean isPossible(String design){
+
+        if(memo.containsKey(design)) {
+            return memo.get(design);
+        }
+
+        if(StringUtils.EMPTY.equals(design)) {
+            return true;
+        }
+
+        for(String pattern : patterns) {
+            int index = design.indexOf(pattern);
+            if(index != - 1) {
+                String leftSide = design.substring(0, index);
+                String rightSide = design.substring(index+pattern.length());
+
+                memo.put(leftSide, isPossible(leftSide));
+                memo.put(rightSide, isPossible(rightSide));
+
+                if(memo.get(leftSide) && memo.get(rightSide)) {
+                    return true;
+                }
+            }
+        }
+
+        return false;
+    }
+
+}

src/main/java/com/adventofcode/flashk/day19/PatternComparator.java

@@ -0,0 +1,17 @@
+package com.adventofcode.flashk.day19;
+
+import java.util.Comparator;
+
+public class PatternComparator implements Comparator<String> {
+
+    @Override
+    public int compare(String o1, String o2) {
+        if(o1.length() < o2.length()) {
+            return 1;
+        }
+        if(o1.length() > o2.length()) {
+            return -1;
+        }
+        return 0;
+    }
+}

src/test/java/com/adventofcode/flashk/day19/Day19Test.java

@@ -36,7 +36,9 @@ public void testSolvePart1Sample() {
 		// Read input file
 		List<String> inputs = Input.readStringLines(INPUT_FOLDER, TestFilename.INPUT_FILE_SAMPLE);
 
-		assertEquals(0L,0L);
+		LinenLayout linenLayout = new LinenLayout(inputs);
+
+		assertEquals(6, linenLayout.solveA());
 	}
 
 	@Test
@@ -48,8 +50,9 @@ public void testSolvePart1Input() {
 
 		// Read input file
 		List<String> inputs = Input.readStringLines(INPUT_FOLDER, TestFilename.INPUT_FILE);
+		LinenLayout linenLayout = new LinenLayout(inputs);
 
-		System.out.println("Solution: ");
+		System.out.println("Solution: "+linenLayout.solveA());
 		assertEquals(0L,0L);
 
 	}