simple clear solution for Merge Intervals by StefanPochmann - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

simple solution in Clear category for Merge Intervals by StefanPochmann

def merge_intervals(intervals):
    result = []
    for interval in intervals:
        if not result or interval[0] > result[-1][1] + 1:
            result.append(interval)
        result[-1] = result[-1][0], max(result[-1][1], interval[1])
    return result

July 25, 2017

Comments:

StefanPochmann on July 25, 2017, 9:51 p.m.
Alternatively, a little more efficient and maybe clearer: <pre class='brush: python'>def merge_intervals(intervals): result = [] for interval in intervals: if not result or interval[0] > result[-1][1] + 1: result.append(interval) else: result[-1] = result[-1][0], max(result[-1][1], interval[1]) return result </pre>

vlad.bezden on Feb. 23, 2020, 1:34 a.m.
Nice solution to reuse last item.

jsg-inet on Aug. 12, 2021, 7:03 a.m.
Smart!

adamspj on March 13, 2024, 2:28 a.m.
Wow. This one kind of broke my brain for a moment, trying to see why it works without the "else." Then it clicked and I realized, in the case where you've appended a new interval, it effectively compares the interval to itself, thus sort of "elsing" that line of code out of existence. Hehe.

Different kind of sets

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.