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

Compare commits

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

3 commits
3e42548f95 ... 14e8b539c6

Author SHA1 Message Date
Bruno BELANYI 14e8b539c6 2022: d15: ex2: add solution 2022-12-15 17:15:57 +01:00
Bruno BELANYI 0f91c37d6d 2022: d15: ex2: add input 2022-12-15 17:15:57 +01:00
Bruno BELANYI 1ce063154e 2022: d15: ex1: add solution 2022-12-15 17:15:57 +01:00
2 changed files with 4 additions and 2 deletions
Show stats Expand all files Collapse all files

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

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

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

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