首页 > 代码库 > LeetCode Merge Intervals
LeetCode Merge Intervals
class Solution { private: static int compare(const Interval& a, const Interval& b) { return a.start < b.start; } public: vector<Interval> merge(vector<Interval> &intervals) { vector<Interval> res; int len = intervals.size(); if (len < 1) return res; sort(intervals.begin(), intervals.end(), Solution::compare); Interval merged = intervals[0]; for (int i=1; i<len; i++) { Interval& cur = intervals[i]; if (merged.end >= cur.start) { // merge two intervals if (merged.end < cur.end) merged.end = cur.end; } else { res.push_back(merged); merged = cur; } } res.push_back(merged); return res; } };
水一发
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。