20170401-leetcode-435-Non-overlapping Intervals
2017-04-02 21:14
344 查看
2017年4月1日 17:29:07
Note:
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.
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:
Example 2:
Example 3:
解读
给出一些的间隔,去掉其中的n个,使得这些间隔彼此之间不重复,求n的最小值
对intervals进行排序,排序的关键词为每个间隔的右阈值,这样每次比较当前间隔的左阈值和上一个间隔的右阈值,如果当前的比较大的话,说明没有问题,不会重复,否则的话输出值+1
mark:
end=float(‘-inf’)
for item in sorted(intervals,key=lambda item:item.end)
1.Description
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.
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.
解读
给出一些的间隔,去掉其中的n个,使得这些间隔彼此之间不重复,求n的最小值
2.Solution
这是给定的函数,直接调用# Definition for an interval. # class Interval(object): # def __init__(self, s=0, e=0): # self.start = s # self.end = e
对intervals进行排序,排序的关键词为每个间隔的右阈值,这样每次比较当前间隔的左阈值和上一个间隔的右阈值,如果当前的比较大的话,说明没有问题,不会重复,否则的话输出值+1
class Solution(object): def eraseOverlapIntervals(self, intervals): """ :type intervals: List[Interval] :rtype: int """ end, num = float('-inf'), 0 for item in sorted(intervals, key=lambda item: item.end): if item.start >= end: end = item.end else: num += 1 return num
mark:
end=float(‘-inf’)
for item in sorted(intervals,key=lambda item:item.end)
相关文章推荐
- 20170401-leetcode-435-Non-overlapping Intervals
- LeetCode - 435 - Non-overlapping Intervals
- [LeetCode] 435 Non-overlapping Intervals
- LeetCode 435 Non-overlapping Intervals
- Leetcode: Non-overlapping Intervals
- [LeetCode] 689. Maximum Sum of 3 Non-Overlapping Subarrays 三个非重叠子数组的最大和
- 第十五周:( LeetCode600) Non-negative Integers without Consecutive Ones(c++)
- LeetCode Non-decreasing Array
- Wildcard Matching (Recursive and Non Recursive method) (Leetcode 网易有道面试题)
- LeetCode 689 Maximum Sum of 3 Non-Overlapping Subarrays
- [LeetCode] Maximum Sum of 3 Non-Overlapping Subarrays 三个非重叠子数组的最大和
- leetcode——Non-overlapping Intervals
- leetcode 689. Maximum Sum of 3 Non-Overlapping Subarrays 3个连续子数组最大和+动态规划DP
- [LeetCode] Nonrecursive preorder traversal
- [算法分析与设计] leetcode 每周一题: Non-overlapping Intervals
- leetcode#689. Maximum Sum of 3 Non-Overlapping Subarrays
- leetcode之数组类之区间类-----OJ 56/57/435/239 重叠区间个数 合并区间 插入区间 滑动窗口最大值
- leetcode oj java Non-overlapping Intervals
- (dp)LeetCode Weekly Contest 34 -Non-negative Integers without Consecutive Ones
- Leetcode 600 Non-negative Integers without Consecutive Ones