[leetcode] problem 57 – insert interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example

No.1

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]

Output: [[1,5],[6,9]]

No.2

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]

Output: [[1,2],[3,10],[12,16]]

Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

Code

public int[][] insert(int[][] intervals, int[] newInterval) {
    List<int[]> result = new ArrayList<>();
    int pos = 0;

    for (int i = 0; i < intervals.length; i++) {
        if (intervals[i][1] < newInterval[0]) {
            result.add(intervals[i]);
            pos++;
        }
        else if (intervals[i][0] > newInterval[1])
            result.add(intervals[i]);
        else {
            newInterval[0] = Math.min(newInterval[0], intervals[i][0]);
            newInterval[1] = Math.max(newInterval[1], intervals[i][1]);
        }
    }

    result.add(pos, newInterval);
    return result.toArray(new int[result.size()][]);
}

[leetcode] problem 57 – insert interval

Example

No.1

No.2

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能