mirror of
https://github.com/Crocmagnon/advent-of-code.git
synced 2024-11-22 06:28:11 +01:00
Solve day 4 part 2
This commit is contained in:
parent
6df229bfe5
commit
070296abe3
1 changed files with 16 additions and 5 deletions
|
@ -1,12 +1,23 @@
|
||||||
def matches(num):
|
def matches(num):
|
||||||
previous = ""
|
|
||||||
two_adjacents = False
|
two_adjacents = False
|
||||||
for digit in str(num):
|
num = str(num)
|
||||||
if digit == previous:
|
i = 0
|
||||||
|
while i < len(num):
|
||||||
|
current = num[i]
|
||||||
|
previous = ""
|
||||||
|
before_previous = ""
|
||||||
|
next_ = ""
|
||||||
|
if i > 0:
|
||||||
|
previous = num[i - 1]
|
||||||
|
if i > 1:
|
||||||
|
before_previous = num[i - 2]
|
||||||
|
if i < len(num) - 1:
|
||||||
|
next_ = num[i + 1]
|
||||||
|
if current == previous and current != before_previous and current != next_:
|
||||||
two_adjacents = True
|
two_adjacents = True
|
||||||
if digit < previous:
|
if current < previous:
|
||||||
return 0
|
return 0
|
||||||
previous = digit
|
i += 1
|
||||||
|
|
||||||
return 1 if two_adjacents else 0
|
return 1 if two_adjacents else 0
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue