Given an array of intervals intervals
where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Example 1:
Input: intervals = [[1,2],[2,3],[3,4],[1,3]]
Output: 1
Explanation: [1,3] can be removed and the rest of the intervals are non-overlapping.
Example 2:
Input: intervals = [[1,2],[1,2],[1,2]]
Output: 2
Explanation: You need to remove two [1,2] to make the rest of the intervals non-overlapping.
Example 3:
Input: intervals = [[1,2],[2,3]]
Output: 0
Explanation: You don't need to remove any of the intervals since they're already non-overlapping.
Constraints:
1 <= intervals.length <= 105intervals[i].length == 25 * 104 <= starti < endi <= 5 * 104給定一個 2D 陣列 intervals
每個 intervals[i] = [ $start_i, end_i$] 代表一段 $start_i$ < value ≤$end_i$ 的區間
當區間發生重疊時，透過移除掉一個區間來避免重疊
要求寫一個演算法找出最少移出多少區間可以讓原本的 intervals 變成都沒有重疊的區間
首先，先觀察什麼狀況會造成重疊