leetcode-435. Non-overlapping Intervals

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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.

这个题目可以考虑先排序，排序的情况是首先按照start升序，然后按照end升序。接下来访问数组，分情况讨论。时间复杂度O(nlgn）。空间复杂度O（1）

由于数组已经升序排序，那么数组往后的元素 i 一定在前面元素的start之后，用一个变量end记录当前横跨坐标的end

1、考虑当前的元素 i.start。如果 i .start 大于end，不需要remove，把end变成当前元素 i.end。

2、当前元素 i.start 小于 end，那么有交集， 移除数量+1，如果 end 取 当前end和i.end的较小值。Your runtime beats 97.48% of java submissions.

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {
    public int eraseOverlapIntervals(Interval[] intervals) {
        if(intervals.length <=1) return 0;
        Arrays.sort(intervals, new Comparator<Interval>(){
            @Override
            public int compare(Interval a, Interval b){
                if(a.start > b.start) return 1;
                else if(a.start < b.start) return -1;
                else{
                    if(a.end < b.end) return 1;
                    else if(a.end > b.end) return -1;
                    else return 0;
                }
            }
        });
        int count = 0, end = intervals[0].end;
        for(int i = 1; i < intervals.length; i++){
            if(intervals[i].start >= end) end = intervals[i].end;
            else {
                if(intervals[i].end <= end) end = intervals[i].end;
                count ++;
            }
        }
        return count;
    }
}