leetcode_c++:Insert Intervals(057)

原创 2016年05月31日 22:52:58

题目

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].

Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].


算法

复杂度:O(N)




class Solution{
public:
    vector<Interval> insert(vector<Interval> &intervals,Interval newInterval){
        vector<Interval>::iterator it=intervals.begin();
        vector<Interval>::iterator it_head=it;  //head of earse item

        while(it != intervals.end()){
            if(newInterval.end<it->start){
                it=intervals.erase(it_head,it);
                intervals.insert(it,newInterval);
                return intervals;

            }else if(newInterval.start>it->end){
                it++;
                it_head++;

            }else{
                newInterval.start=min(newInterval.start,it->start);
                newInterval.end=max(newInterval.end,it->end);

                it++;
            }
        }

        if(it_head!=it)
            it=intervals.erase(it_head,it);
        intervals.insert(intervals.end(), newInterval);
        return intervals;

    }
};
版权声明:本文为博主原创文章,未经博主允许不得转载。

LeetCode057 Insert Interval

详细见:leetcode.com/problems/insert-interval Java Solution: github package leetcode; import ja...
  • zxwtry
  • zxwtry
  • 2017年04月12日 18:49
  • 75

LeetCode(56) Insert Intervals

题目如下: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if ...

LeetCode 57. Insert Interval/56. Merge Intervals

1. 题目要求 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge ...

[LeetCode]Merge Intervals && Insert Interval

LeetCode: https://oj.leetcode.com/problems/merge-intervals/

Merge Intervals And Insert Interval -- Leetcode

leetcode 中的两个集合操作题目: Merge Intervals , Insert Interval

[LeetCode35]Insert Intervals

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessa...
  • sbitswc
  • sbitswc
  • 2014年06月19日 00:18
  • 640

LeetCode 之 Merge Intervals — C++ 实现

Merge Intervals Given a collection of intervals, merge all overlapping intervals. For exampl...

[C++]LeetCode: 41 Search Insert Position

题目: Given a sorted array and a target value, return the index if the target is found. If not, r...

LeetCode 35 Search Insert Position (C,C++,Java,Python)

Problem: Given a sorted array and a target value, return the index if the target is found. If n...

LeetCode 35 — Search Insert Position(C++ Java Python)

题目:http://oj.leetcode.com/problems/search-insert-position/ Given a sorted array and a target value...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode_c++:Insert Intervals(057)
举报原因:
原因补充:

(最多只允许输入30个字)