56. Merge Intervals

    xiaoxiao2025-01-22  16

    重写一个类MyComparator,将原来的集合按照规定排序。

    问题:MyComparator 定义为public class时也可以通过 

    public class Solution { class MyComparator implements Comparator<Interval> { @Override public int compare(Interval a, Interval b) { return a.start - b.start; //按照a.start-b.start的大小来排序 } } public List<Interval> merge(List<Interval> intervals) { List<Interval> ans = new ArrayList<Interval>(); if (intervals.size() == 0) return ans; Collections.sort(intervals, new MyComparator()); int start = intervals.get(0).start; int end = intervals.get(0).end; for (int i = 0; i < intervals.size(); i++) { Interval inter = intervals.get(i); if (inter.start > end) { ans.add(new Interval(start, end)); start = inter.start; end = inter.end; } else { end = Math.max(end, inter.end); } } ans.add(new Interval(start, end)); return ans; } }

    转载请注明原文地址: https://ju.6miu.com/read-1295732.html
    最新回复(0)