leetcodequestion_56 Merge Intervals
2013-09-26 23:08
295 查看
Given a collection of intervals, merge all overlapping intervals.
For example,
Given
return
For example,
Given
[1,3],[2,6],[8,10],[15,18],
return
[1,6],[8,10],[15,18].
vector<Interval> merge(vector<Interval>& intervals) { // Start typing your C/C++ solution below // DO NOT write int main() function sort(intervals.begin(), intervals.end(), cmp); vector<Interval> res; vector<Interval>::iterator it = intervals.begin(); Interval* cur = NULL; for(it; it != intervals.end(); ++it) { if(cur == NULL) { cur = &(*it); continue; } if((*cur).end < (*it).start) { res.push_back(*cur); cur = &(*it); }else{ (*cur).end = (*cur).end > (*it).end ? (*cur).end : (*it).end; } } if(cur != NULL) res.push_back(*cur); return res; }
相关文章推荐
- leetcodequestion_56 Merge Intervals
- leetcode 56: Merge Intervals
- LeetCode-56-Merge Intervals(C语言实现)
- 【leetcode】Array—— Merge Intervals(56)
- leetcode-56 Merge Intervals 合并区间
- LeetCode 56 Merge Intervals--In C++
- [leetcode 56] Merge Intervals
- leetCode 56, Merge Intervals
- LeetCode - 56 - Merge Intervals
- LeetCode-56-Merge Intervals Python自定义sort,贪心
- LeetCode_56---Merge Intervals
- 【LeetCode】C# 56、Merge Intervals
- LeetCode 56 --- Merge Intervals
- LeetCode_OJ【56】Merge Intervals
- LeetCode 56 Merge Intervals(Python实现及详解)
- [LeetCode 56] Merge Intervals
- [Leetcode 56, Hard] Merge intervals
- leetcode || 56、 Merge Intervals
- [Leetcode 84] 56 Merge Intervals
- LeetCode56 Merge Intervals