56. Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

Example 2:

Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.
哦豁，跟57题简直一毛一样，于是就想套一下，把57题当method

/**
 * 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; }
 * }
 */
class Solution {
    public List<Interval> merge(List<Interval> intervals) {
        List<Interval> res = new ArrayList<Interval>();
        for (int i = 0; i < intervals.size(); ++i) {
            res = insert(res, intervals.get(i));
        }
        return res;
    }
      public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
        List<Interval> res= new ArrayList<Interval>();
        int l = intervals.size();
        for(Interval each : intervals){
            if(each.end < newInterval.start){
                res.add(each);
            }
            else if(newInterval.end < each.start){
                res.add(newInterval);
                newInterval = each;
            }
            else if(newInterval.start <= each.end || each.start <= newInterval.end){
               newInterval.start = (Math.min(newInterval.start, each.start));
                newInterval.end = (Math.max(newInterval.end, each.end));
            }
        }
        res.add(newInterval);
        return res;
    }
}

还可以修改Collections.sort,具体如下

public ArrayList<Interval> merge(ArrayList<Interval> intervals) {
        if (intervals == null || intervals.size() <= 1)
            return intervals;
 
        // sort intervals by using self-defined Comparator
        Collections.sort(intervals, new IntervalComparator());
 
        ArrayList<Interval> result = new ArrayList<Interval>();
 
        Interval prev = intervals.get(0);
        for (int i = 1; i < intervals.size(); i++) {
            Interval curr = intervals.get(i);
 
            if (prev.end >= curr.start) {
                // merged case
                Interval merged = new Interval(prev.start, Math.max(prev.end, curr.end));
                prev = merged;
            } else {
                result.add(prev);
                prev = curr;
            }
        }
 
        result.add(prev);
 
        return result;
        }
    }
 
    class IntervalComparator implements Comparator<Interval> {
        public int compare(Interval i1, Interval i2) {
            return i1.start - i2.start;
        }

挖个坑

转载于:https://www.cnblogs.com/wentiliangkaihua/p/10412265.html