non-overlapping-intervals

https://leetcode.com/problems/non-overlapping-intervals/

其中还用到了Java的Comparator接口和其中的compare方法。

package com.company;import java.util.*;class Interval {int start;int end;Interval() { start = 0; end = 0; }Interval(int s, int e) { start = s; end = e; }
}class Solution {class IntervalComp implements Comparator {@Overridepublic int compare(Object o1, Object o2) {Interval i1 = (Interval)o1;Interval i2 = (Interval)o2;return i1.start - i2.start;}}public int eraseOverlapIntervals(Interval[] intervals) {if (intervals.length == 0) {return 0;}Arrays.sort(intervals, new IntervalComp());int ret = 0;int last = intervals[0].end;for (int i=1; i<intervals.length; i++) {if (intervals[i].start >= last) {last = intervals[i].end;continue;}if (intervals[i].end >= last) {ret++;}else {ret++;last = intervals[i].end;}}return ret;}
}public class Main {public static void main(String[] args) throws InterruptedException {System.out.println("Hello!");Solution solution = new Solution();Interval[] it = new Interval[2];it[0] = new Interval(1, 2);it[1] = new Interval(2, 3);int ret = solution.eraseOverlapIntervals(it);System.out.printf("Get ret: %d\n", ret);System.out.println();/*Iterator<List<Integer>> iterator = ret.iterator();while (iterator.hasNext()) {Iterator iter = iterator.next().iterator();while (iter.hasNext()) {System.out.printf("%d,", iter.next());}System.out.println();}*/System.out.println();}
}

non-overlapping-intervals相关推荐

LeetCode 56. Merge Intervals
原题链接在这里:https://leetcode.com/problems/merge-intervals/ 题目: Given a collection of intervals, merge al ...
LeetCode Merge Intervals
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8, ...
LeetCode:Merge Intervals
题目链接 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6 ...
LeetCode-56-Merge Intervals
算法描述: Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2, ...
[LeetCode]Merge Intervals
题目:Merge Intervals 给定n个区间合并重合区间思路: 先按照区间起点排序,然后合并下面情况: 1.起点相同,以最大的终点为新的终点: 2.前一个终点大于后一个的起点. /****** ...
【leetcode】56. Merge Intervals 相邻线段归并
1. 题目 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2, ...
merge intervals(合并间隔)
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8, ...
[leetcode sort]56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8, ...
C#LeetCode刷题之#56-合并区间（Merge Intervals）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3676 访问. 给出一个区间的集合,请合并所有重叠的区间. 输入: ...
[leetcode]Merge Intervals @ Python
原题地址:https://oj.leetcode.com/problems/merge-intervals/ 题意: Given a collection of intervals, merge al ...

non-overlapping-intervals

non-overlapping-intervals相关推荐

最新文章

热门文章