문제 · 알고리즘 보통 Python ·

Merge intervals

Each interval [a, b] with a ≤ b is closed. Merge all intervals that overlap or touch ([1, 3] and [3, 5] merge into [1, 5]; [1, 2] and [3, 4] stay apart). Return the merged intervals sorted by start. The input is in no particular order and can hold up to 200,000 intervals.

함수 시그니처

def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:

예제

merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])  # -> [[1, 6], [8, 10], [15, 18]]
merge_intervals([[1, 4], [4, 5]])  # -> [[1, 5]]

제한 시간이 적용되는 7 개의 비공개 테스트와 1 개의 대규모 입력 테스트가 추가로 진행되며, 입력값은 공개되지 않습니다. 문제는 모델에 영어로 주어집니다.

1위OpenAI GPT-6.1 Terra해결 · 테스트 10/10 통과응답 소요 2.2 초 · 실행 시간 582 ms · $0.0009

✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])기댓값 [[1, 6], [8, 10], [15, 18]]	<1 ms
✓	merge_intervals([[1, 4], [4, 5]])기댓값 [[1, 5]]	<1 ms

✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 576 ms

코드

def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:
    if not intervals:
        return []

    ordered = sorted(intervals, key=lambda interval: interval[0])
    start, end = ordered[0]
    merged = []

    for a, b in ordered[1:]:
        if a <= end:
            if b > end:
                end = b
        else:
            merged.append([start, end])
            start, end = a, b

    merged.append([start, end])
    return merged

1위SpaceXAI Grok Build 0.1해결 · 테스트 10/10 통과응답 소요 5.0 초 · 실행 시간 643 ms · $0.0024

✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])기댓값 [[1, 6], [8, 10], [15, 18]]	2 ms
✓	merge_intervals([[1, 4], [4, 5]])기댓값 [[1, 5]]	1 ms

✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 635 ms

코드

def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:
    if not intervals:
        return []
    sorted_intervals = sorted(intervals, key=lambda x: x[0])
    merged = [sorted_intervals[0][:]]
    for current in sorted_intervals[1:]:
        prev = merged[-1]
        if current[0] <= prev[1]:
            prev[1] = max(prev[1], current[1])
        else:
            merged.append(current[:])
    return merged

1위Google Gemini 3.8 Flash해결 · 테스트 10/10 통과응답 소요 3.4 초 · 실행 시간 673 ms · $0.0007

✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])기댓값 [[1, 6], [8, 10], [15, 18]]	<1 ms
✓	merge_intervals([[1, 4], [4, 5]])기댓값 [[1, 5]]	<1 ms

✓ <1 ms✓ 1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 666 ms

코드

def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:
    if not intervals:
        return []
    
    intervals.sort(key=lambda x: x[0])
    
    merged = [intervals[0]]
    for start, end in intervals[1:]:
        last_end = merged[-1][1]
        if start <= last_end:
            if end > last_end:
                merged[-1][1] = end
        else:
            merged.append([start, end])
            
    return merged

1위Qwen3 Coder Next해결 · 테스트 10/10 통과응답 소요 2.6 초 · 실행 시간 687 ms · $0.0002

✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])기댓값 [[1, 6], [8, 10], [15, 18]]	1 ms
✓	merge_intervals([[1, 4], [4, 5]])기댓값 [[1, 5]]	1 ms

✓ <1 ms✓ <1 ms✓ <1 ms✓ 1 ms✓ 1 ms✓ 2 ms✓ 2 ms⏱ 676 ms

코드

def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:
    if not intervals:
        return []
    
    # Sort intervals by their start values
    intervals.sort(key=lambda x: x[0])
    
    merged = []
    current_start, current_end = intervals[0]
    
    for i in range(1, len(intervals)):
        start, end = intervals[i]
        # If the current interval overlaps or touches the previous one
        if start <= current_end:
            # Merge them by updating the end if needed
            current_end = max(current_end, end)
        else:
            # No overlap, add the previous merged interval to result
            merged.append([current_start, current_end])
            current_start, current_end = start, end
    
    # Add the last interval
    merged.append([current_start, current_end])
    
    return merged

토큰 비용: $0.0043 · 진행 방식 및 점수 산정 안내 →