NC37 合并区间

牛客华为机试题库【题号 HJ开头】（重点看）
牛客在线编程算法篇【题号NC开头】
剑指offer【题号 JZ开头】
力扣

1）原题链接

2）已有题解

3）代码

package array;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;

/**
 * NC37 合并区间
 */
public class NC37CombinedArea {
    public static void main(String[] args) throws IOException {
        ArrayList<Interval> list = new ArrayList<>();
        list.add(new Interval(10, 30));
        list.add(new Interval(20, 60));
        list.add(new Interval(80, 100));
        list.add(new Interval(150, 180));
        ArrayList<Interval> merge = merge(list);
        System.out.println(merge);
    }

    public static ArrayList<Interval> merge(ArrayList<Interval> intervals) {
        if (intervals.size() <= 1) {
            return intervals;
        }

        // 两个指标都排序排序
        List<Interval> orderedIntervals = intervals.stream().sorted((a, b) -> {
            if (a.start == b.start) {
                return a.end - b.end;
            } else {
                return a.start - b.start;
            }
        }).collect(Collectors.toList());


        // 基底
        Interval base = orderedIntervals.get(0);

        ArrayList<Interval> res = new ArrayList<>();
        for (int i = 1; i < orderedIntervals.size(); i++) {
            if (isNotUnit(base, orderedIntervals.get(i))) {
                res.add(base); // 不相交，收集基底
                base = orderedIntervals.get(i); // 变基
            } else {
                base = getNew(base, orderedIntervals.get(i)); // 当前区间和Base区间取并集
            }
            if (i == orderedIntervals.size() - 1) { // 当前项为最后一项的话、直接收集起来
                res.add(base);
            }
        }
        return res;
    }

    /**
     * 判断两个区间不想交
     */
    public static boolean isNotUnit(Interval left, Interval right) {
        return left.end < right.start;
    }

    /**
     * 获取最大区间
     */
    public static Interval getNew(Interval left, Interval right) {
        int min = Math.min(left.start, right.start);
        int max = Math.max(left.end, right.end);
        return new Interval(min, max);
    }

}

class Interval {
    int start;
    int end;

    Interval() {
        start = 0;
        end = 0;
    }

    Interval(int s, int e) {
        start = s;
        end = e;
    }

    @Override
    public String toString() {
        return "[" + start + "," + end + ']';
    }
}