Solve day 13 2015 part 2: Knights of the Dinner Table

SimonBaars · SimonBaars · commit e13d3c96b121 · 2025-01-29T02:56:11.000+01:00
diff --git a/src/main/java/com/sbaars/adventofcode/year15/days/Day13.java b/src/main/java/com/sbaars/adventofcode/year15/days/Day13.java
@@ -20,6 +20,7 @@ public static void main(String[] args) {
         Day13 day = new Day13();
         day.printParts();
         new com.sbaars.adventofcode.network.Submit().submit(day.part1(), 2015, 13, 1);
+        new com.sbaars.adventofcode.network.Submit().submit(day.part2(), 2015, 13, 2);
     }
 
     private void parseInput() {
@@ -49,7 +50,18 @@ public Object part1() {
 
     @Override
     public Object part2() {
-        return 0; // Implement in next part
+        // Add myself to the list with happiness 0 for all relationships
+        String me = "Me";
+        Map<String, Integer> myHappiness = new HashMap<>();
+        for (String person : people) {
+            myHappiness.put(person, 0);
+            happinessMap.get(person).put(me, 0);
+        }
+        happinessMap.put(me, myHappiness);
+        people.add(me);
+        
+        List<String> peopleList = new ArrayList<>(people);
+        return findMaxHappiness(peopleList);
     }
 
     private int findMaxHappiness(List<String> peopleList) {
