Advent of Code 2022: Day 4
β’ 135 words β’ 1 min β’ updated
β οΈ This post is over one year old. It may no longer be up to date or relevant. Opinions may have changed.
Refer to the previous post about AoC, and to the git repository with my solutions in Python 3.
Link to Day #4 puzzle.
Find overlapping cleaning assignment pairs.
python
#!/usr/bin/env python3
import sys
def eitherContains(e1, e2):
if e1[0] >= e2[0] and e1[1] <= e2[1]:
return 1
elif e2[0] >= e1[0] and e2[1] <= e1[1]:
return 1
else:
return 0
def anyOverlap(e1, e2):
return int((e1[1] >= e2[0]) and (e1[0] <= e2[1]))
def main():
with open(sys.argv[1]) as input:
lines = input.read().splitlines()
totalEitherContains = 0
totalAnyOverlap = 0
for line in lines:
# [['2', '4'], ['6', '8']]
[e1, e2] = [el.split('-') for el in line.split(',')]
# [2, 4], [6, 8]
e1, e2 = list(map(int, e1)), list(map(int, e2))
totalEitherContains += eitherContains(e1, e2)
totalAnyOverlap += anyOverlap(e1, e2)
# Part 1
print(totalEitherContains)
# Part 2
print(totalAnyOverlap)
if __name__ == '__main__':
main()