题目:
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Note:
- You may assume the interval's end point is always bigger than its start point.
- Intervals like [1,2] and [2,3] have borders "touching" but they don't overlap each other.
Example 1:
Input: [ [1,2], [2,3], [3,4], [1,3] ] Output: 1 Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.
Example 2:
Input: [ [1,2], [1,2], [1,2] ] Output: 2 Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.
Example 3:
Input: [ [1,2], [2,3] ] Output: 0 Explanation: You don't need to remove any of the intervals since they're already non-overlapping.
题解:题目要求找出删除几组数据能使剩下的数据不重叠,一开始思路是把数据先升序排列,第一个数字相同的再按照第二个数字升序排列,然后比较相邻的数据后一个数据i+1的start是否大于前一个数据i的end,如果大于则继续循环比较,如果小于则把结果+1并找到start比那数据i+1的end大的数据k,继续往后遍历。由于没有考虑到数据i与找到的数据k是否有重叠,所以出现了错误,在错误样例中可以明显发现这个问题。所以,我改成把数据i+1删掉,后面的数据依次往前移一个,此时要记得最后pop_back(),否则vector的大小没有变,会导致结果出错。然后继续从i开始循环,直到最后返回结果。
答案:
/**
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
static bool cmp(Interval& a,Interval& b)
{
if(a.start<b.start)
return 1;
else if(a.start==b.start)
{
if(a.end<b.end)
return 1;
else
return 0;
}
else
return 0;
}
int eraseOverlapIntervals(vector<Interval>& intervals) {
if(intervals.size()==1||intervals.size()==0)
return 0;
sort(intervals.begin(),intervals.end(),cmp);
int result=0;
for(int i=0;i<intervals.size()-1;i++)
{
if(intervals[i+1].start<intervals[i].end)
{
result++;
if(intervals[i].end<intervals[i+1].end)
{
for(int k=i+1;k<intervals.size()-1;k++)
{
intervals[k]=intervals[k+1];
}
intervals.pop_back();
i=i-1;
}
}
}
return result;
}
};