We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2e0edfc commit 551aa17Copy full SHA for 551aa17
57-Insert-Interval.java
@@ -0,0 +1,24 @@
1
+class Solution {
2
+ public int[][] insert(int[][] intervals, int[] newInterval) {
3
+ List<int[]> result = new ArrayList<>();
4
+ for(int i = 0; i < intervals.length; i++){
5
+ if(newInterval[1] < intervals[i][0]){
6
+ result.add(newInterval);
7
+ while(i < intervals.length){
8
+ result.add(intervals[i]);
9
+ i++;
10
+ }
11
+ return result.toArray(new int[result.size()][2]);
12
13
+ else if(newInterval[0] > intervals[i][1]){
14
15
16
+ else{
17
+ newInterval[0] = Math.min(newInterval[0],intervals[i][0]);
18
+ newInterval[1] = Math.max(newInterval[1],intervals[i][1]);
19
20
21
22
23
24
+}
0 commit comments