56. Merge Intervals

最新推荐文章于 2024-07-20 22:34:59 发布

zg1g

最新推荐文章于 2024-07-20 22:34:59 发布

阅读量578

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode merge array sort sort函数

本文链接：https://blog.csdn.net/daigualu/article/details/72912509

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

Given a collection of intervals, merge all overlapping intervals.

For example,

Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

代码实现

first, sort by start for every interval asc.
Then, discuss every interval’s end point.

public IList<Interval> Merge(IList<Interval> intervals)
        {
            if(intervals.Count==0|| intervals.Count==1) return intervals;
            var rtn = new List<Interval>();
            var s = intervals.OrderBy(r => r.start).ToList();
            rtn.Add(s[0]);
            for (int i = 1; i < s.Count; i++)
            {
                //analysis and discuss every interval's end point
                //overlap wholely
                if (rtn[rtn.Count - 1].end >= s[i].end)
                {
                    continue;
                }
                //overlap partly
                else if (rtn[rtn.Count - 1].end >= s[i].start)
                {
                    rtn[rtn.Count-1].end = s[i].end;
                }
                else //no overlap
                {
                    rtn.Add(s[i]);
                }           
            }
            return rtn;
        }