g0001_0100.s0056_merge_intervals.Solution.dart Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
// #Big_O_Time_O(n_log_n)_Space_O(n) #2024_10_05_Time_376_ms_(100.00%)_Space_161.1_MB_(8.16%)

class Solution {
  List> merge(List> intervals) {
    // Sort the intervals based on the start time
    intervals.sort((a, b) =>a[0].compareTo(b[0]));

    List> merged = [];
    List current = intervals[0];
    merged.add(current);

    for (List next in intervals){
      if (current[1] >= next[0]) {
        // If the intervals overlap, merge them
        current[1] = current[1] > next[1] ? current[1] : next[1];
      } else {
        // Otherwise, move to the next interval
        current = next;
        merged.add(current);
      }
    }

    return merged;
  }
}