c# leetcode 56合并区间

给出一个区间的集合，请合并所有重叠的区间。

示例 1:

输入: [[1,3],[2,6],[8,10],[15,18]]
输出: [[1,6],[8,10],[15,18]]
解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6].
示例 2:

输入: [[1,4],[4,5]]
输出: [[1,5]]
解释: 区间 [1,4] 和 [4,5] 可被视为重叠区间。

 

It is a good idea to review all my submissions, so that I can learn from my own experience.

 

Here are highlights:

First, let me introduce of LINQ API - OrderBy to help sort all intervals by start time;
Next, IEnumerable.ToList is applied to convert to IList;
If need, refresh LINQ API; I learned quickly back in 2017 but not used last 12 months;
Learn how to merge two intervals, detail will be added later.
 

        public static   IList<Interval> Merge(IList<Interval> intervals)
        {

            IList<Interval> nonOverlapped = new List<Interval>();
            if (intervals == null || intervals.Count == 0)
            {
                return intervals;
            }

            //1转换为IEnumerable后排序
            IEnumerable<Interval> sortedEnum = intervals.OrderBy(f => f.start);
            IList<Interval> sortedIntervals = sortedEnum.ToList();
            //第一个
            Interval previous = sortedIntervals[0];
            //循环数组
            for (int i = 0; i < sortedIntervals.Count; i++)
            {
                Interval current = sortedIntervals[i];
                //如果后一个小于前一个
                if (previous.end<current.start)
                {
                    nonOverlapped.Add(previous);
                    previous = current;
                    continue;
                }
                previous = new Interval(previous.start, Math.Max(previous.end, current.end));
            }
            nonOverlapped.Add(previous);
            return nonOverlapped;
        } 

    public class Interval
    {
        public int start;
        public int end;
        public Interval() { start = 0;end = 0; }
        public Interval(int s, int e) { start = s;end = e; }
    }