LeetCode-Java/Insert Intervals at main · dhinith2007/LeetCode-Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
LEETCODE PROBLEM SOLVING
PROBLEM->INSERT INTERVALS
import java.util.*;

class Solution {

    public int[][] insert(int[][] intervals, int[] newInterval) {

        List<int[]> result = new ArrayList<>();

        for (int[] interval : intervals) {
            if (interval[1] < newInterval[0]) {

                result.add(interval);

            }
            else if (interval[0] > newInterval[1]) {

                result.add(newInterval);

                newInterval = interval;

            }
            else {

                newInterval[0] = Math.min(newInterval[0], interval[0]);

                newInterval[1] = Math.max(newInterval[1], interval[1]);
            }
        }

        result.add(newInterval);

        return result.toArray(new int[result.size()][]);
    }
}