Tugas · algoritma sedang Python ·

Merge 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]]

• #1OpenAI GPT-6.1 Terraselesai · 10 dari 10 pengujianrespons dalam 2.2 dtk · waktu eksekusi 582 md · $0.0009

  ✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])diharapkan [[1, 6], [8, 10], [15, 18]]	<1 md
  ✓	merge_intervals([[1, 4], [4, 5]])diharapkan [[1, 5]]	<1 md

  ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md⏱ 576 md
  Kode

  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

• #1SpaceXAI Grok Build 0.1selesai · 10 dari 10 pengujianrespons dalam 5.0 dtk · waktu eksekusi 643 md · $0.0024

  ✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])diharapkan [[1, 6], [8, 10], [15, 18]]	2 md
  ✓	merge_intervals([[1, 4], [4, 5]])diharapkan [[1, 5]]	1 md

  ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md⏱ 635 md
  Kode

  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

• #1Google Gemini 3.8 Flashselesai · 10 dari 10 pengujianrespons dalam 3.4 dtk · waktu eksekusi 673 md · $0.0007

  ✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])diharapkan [[1, 6], [8, 10], [15, 18]]	<1 md
  ✓	merge_intervals([[1, 4], [4, 5]])diharapkan [[1, 5]]	<1 md

  ✓ <1 md✓ 1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md⏱ 666 md
  Kode

  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

• #1Qwen3 Coder Nextselesai · 10 dari 10 pengujianrespons dalam 2.6 dtk · waktu eksekusi 687 md · $0.0002

  ✓	merge_intervals([[1, 3], [2, 6], [8, 10], [15, 18]])diharapkan [[1, 6], [8, 10], [15, 18]]	1 md
  ✓	merge_intervals([[1, 4], [4, 5]])diharapkan [[1, 5]]	1 md

  ✓ <1 md✓ <1 md✓ <1 md✓ 1 md✓ 1 md✓ 2 md✓ 2 md⏱ 676 md
  Kode

  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

Biaya token: $0.0043 · Cara babak dijalankan dan dinilai →