Day 1 (part 2 bugfix)

day01/part2.py

@@ -9,7 +9,7 @@ tree = dict()
 def tree_up(idx, step=1, offset=0):
     nxt = tree[(idx, step)] if (idx, step) in tree else None
     appendix = [] if nxt is None else tree_up(nxt+idx, step=step+1, offset=idx)
-    return [idx - offset] + appendix
+    return [idx-offset] + appendix
 
 
 def prod(iterable):
@@ -28,10 +28,8 @@ for item in items:
                 prod(vals)
             ))
             exit()
-        elif new[0] < 0 or new[1] < 0:
-            # target value too low or to many sums
-            pass
-        else:
-            tree[new] = item
+        elif new[0] > 0 and new[1] > 0:
+            if new not in tree:
+                tree[new] = item
             tmp_values.add(new)
     values = tmp_values