public/aoc2021
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

day18: there must be a better way to find left and right numbers instead of traversing the full tree again and again ...

Browse Source
This commit is contained in:
Stefan Harmuth 2021-12-21 05:58:37 +01:00
parent 81bef8d2bf
commit 0ef34d1a32
1 changed files with 24 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
day18.py
View File

@ -115,8 +115,21 @@ class BinarySnailfish:
return root return root
def getLeftNumber(self) -> Union[None, 'BinarySnailfish']: def getLeftNumber(self) -> Union[None, 'BinarySnailfish']:
parent = self.parent
if self == self.parent.left:
while parent.parent and parent == parent.parent.left:
parent = parent.parent
parent = parent.left
else:
while parent.parent and parent == parent.parent.right:
parent = parent.parent
parent = parent.right
while parent.right.value is None:
parent = parent.right
return parent
leftnum = None leftnum = None
for current in self.getRoot().traverse_inorder(): for current in self.getRoot().traverse_preorder():
if current == self: if current == self:
return leftnum return leftnum
if current.value is not None: if current.value is not None:
@ -124,7 +137,7 @@ class BinarySnailfish:
def getRightNumber(self) -> Union[None, 'BinarySnailfish']: def getRightNumber(self) -> Union[None, 'BinarySnailfish']:
returnNext = 0 returnNext = 0
for current in self.getRoot().traverse_inorder(): for current in self.getRoot().traverse_preorder():
if returnNext >= 3 and current.value is not None: if returnNext >= 3 and current.value is not None:
return current return current
if returnNext > 0: if returnNext > 0:
@ -150,36 +163,35 @@ class BinarySnailfish:
self.value = 0 self.value = 0
def reduce(self): def reduce(self):
print(self.fours)
if self.value is not None: if self.value is not None:
return return
found = True found = True
while found: while found:
found = False found = False
for n in self.fours: for n in self.traverse_preorder():
self.fours.pop(0) if n.value is None and n.depth == 4:
n.explode() n.explode()
found = True found = True
break break
if found: if found:
continue continue
for n in self.traverse_inorder(): for n in self.traverse_preorder():
if n.value is not None and n.value > 9: if n.value is not None and n.value > 9:
n.split() n.split()
found = True found = True
break break
def traverse_inorder(self): def traverse_preorder(self):
yield self yield self
if self.left: if self.left:
for x in self.left.traverse_inorder(): for x in self.left.traverse_preorder():
yield x yield x
if self.right: if self.right:
for x in self.right.traverse_inorder(): for x in self.right.traverse_preorder():
yield x yield x
def __add__(self, other): def __add__(self, other):