ambroisie/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Compare commits

base: ambroisie:14e8b539c685fd7f1fa9d922190cc57efcd80c41
Branches Tags
ambroisie:main
..
compare: ambroisie:3e42548f95ad11a62a8249685ea33a336f15c615
Branches Tags
ambroisie:main

3 commits
14e8b539c6 ... 3e42548f95

Author SHA1 Message Date
Bruno BELANYI 3e42548f95 2022: d15: ex2: add solution 2022-12-15 11:20:11 +01:00
Bruno BELANYI 8c1bf30b3f 2022: d15: ex2: add input 2022-12-15 11:20:11 +01:00
Bruno BELANYI 1d93813e2d 2022: d15: ex1: add solution 2022-12-15 11:20:11 +01:00
2 changed files with 2 additions and 4 deletions
Show stats Expand all files Collapse all files

3
2022/d15/ex1/ex1.py
View file

@ -31,8 +31,7 @@ def merge_intervals(intervals: Iterable[Interval]) -> list[Interval]:
res = [intervals[0]]
for candidate in intervals[1:]:
# Range is inclusive in both end, so add 1 to end in case of near miss
if (res[-1].end + 1) >= candidate.start:
if res[-1].end >= candidate.start:
new_end = max(res[-1].end, candidate.end)
res[-1] = Interval(res[-1].start, new_end)
else:

3
2022/d15/ex2/ex2.py
View file

@ -31,8 +31,7 @@ def merge_intervals(intervals: Iterable[Interval]) -> list[Interval]:
res = [intervals[0]]
for candidate in intervals[1:]:
# Range is inclusive in both end, so add 1 to end in case of near miss
if (res[-1].end + 1) >= candidate.start:
if res[-1].end >= candidate.start:
new_end = max(res[-1].end, candidate.end)
res[-1] = Interval(res[-1].start, new_end)
else: