标签：Non Intervals int interval solution overlapping intervals non
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.
分析：
The following greedy algorithm does find the optimal solution:
- Select the interval, x, with the earliest finishing time.
- Remove x, and all intervals intersecting x, from the set of candidate intervals.
- Repeat until the set of candidate intervals is empty.
Whenever we select an interval at step 1, we may have to remove many intervals in step 2. However, all these intervals necessarily cross the finishing time of x, and thus they all cross each other. Hence, at most 1 of these intervals can be in the optimal solution. Hence, for every interval in the optimal solution, there is an interval in the greedy solution. This proves that the greedy algorithm indeed finds an optimal solution.
1 class Solution {
2 public int eraseOverlapIntervals(int[][] intervals) {
3 if (intervals.length == 0) {
4 return 0;
5 }
6
7 Arrays.sort(intervals, (interval1, interval2) -> interval1[1] - interval2[1]);
8 int end = intervals[0][1];
9 int count = 1;
10
11 for (int i = 1; i < intervals.length; i++) {
12 if (intervals[i][0] >= end) {
13 end = intervals[i][1];
14 count++;
15 }
16 }
17 return intervals.length - count;
18 }
19 }
标签：Non,Intervals,int,interval,solution,overlapping,intervals,non 来源： https://www.cnblogs.com/beiyeqingteng/p/11231100.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。