greedy——435. Non-overlapping Intervals［medium］

题目描述

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:

1. You may assume the interval's end point is always bigger than its start point.
2. 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.

给定多组区间，选择删除最少的区间，使得剩下的区间无交集。

解题思路

贪心算法，遍历数组，发现重叠就删去范围较大的区间。为什么要去掉范围最大的数组？因为范围大，就意味着能与更多的区间产生交集，所以要去掉。解题图示：

整个步骤如下：

1、对intervals排序，以第一个元素上升排序，第一个相同则按第二个元素上升排序（使用sort排序，自己编写排序函数com）

2、用tmp表示当前区间，如果与检查到的区间有交集，tmp变为两者之间的较小者，计数器＋1（表示应该删去较大的那个）

3、无交集，tmp变为检查到的那个区间，继续2（因为已经排序了，可以保证一旦检查到第一个与tmp无交集的区间，后面的也就不会有交集了）

代码如下

/**
 * 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:
    bool static com(Interval a, Interval b) {
	if (a.start < b.start)
		return true;
	else if (a.start == b.start) {
		if (a.end < b.end)
			return true;

		return false;
	}

	return false;
}

bool inter(Interval a, Interval b) {
	if (a.end > b.start)
		return true;

	return false;
}

int eraseOverlapIntervals(vector<Interval>& intervals) {
    if(intervals.empty())
        return 0;
	sort(intervals.begin(), intervals.end(), com);
	int count = 0;
	
	Interval in = intervals[0];
	int j = 1;
	for (j; j < intervals.size(); j++) {
			if (inter(in, intervals[j])) {
			    	if(in.end > intervals[j].end)
					in = intervals[j];
				count++;
				continue;
			}
			in = intervals[j];
		}
	

	return count;
}
};

题外心得：

1、关于sort比较函数的传入，sort默认是升序排序，要想使得降序，就应该这样做：

bool com(int a,int b){

      return a > b;
}

也就是，让sort认为 a > b（返回true）时就是 a在b前面。

2、这两道贪心算法都涉及了排序。