solves insert inrterval

Author: anishLearnsToCode

README.md

@@ -55,6 +55,7 @@
 |  54  | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix)                                                                                              |                                                                  [![Java](assets/java.png)](src/SpiralMatrix.java)                                                                   |                                                                                                                                   |
 |  55  | [Jump Game](https://leetcode.com/problems/jump-game)                                                                                                      |                                                                    [![Java](assets/java.png)](src/JumpGame.java)                                                                     |                                                                                                                                   |
 |  56  | [Merge Intervals](https://leetcode.com/problems/merge-intervals)                                                                                          |                                                                 [![Java](assets/java.png)](src/MergeIntervals.java)                                                                  |                                                                                                                                   |
+|  57  | [Insert Interval](https://leetcode.com/problems/insert-interval)                                                                                          |                                                                 [![Java](assets/java.png)](src/InsertInterval.java)                                                                  |                                                                                                                                   |
 |  58  | [Length of Last Word](https://leetcode.com/problems/length-of-last-word)                                                                                  |                                 [![Java](assets/java.png)](src/LengthOfLastWord.java) [![Python](assets/python.png)](python/length_of_last_word.py)                                  |                                                                                                                                   |
 |  66  | [Plus One](https://leetcode.com/problems/plus-one)                                                                                                        |                                           [![Java](assets/java.png)](src/PlusOne.java) [![Python](assets/python.png)](python/plus_one.py)                                            |                                                                                                                                   |
 |  67  | [Add Binary](https://leetcode.com/problems/add-binary)                                                                                                    |                                         [![Java](assets/java.png)](src/AddBinary.java) [![Python](assets/python.png)](python/add_binary.py)                                          |                                                                                                                                   |

src/InsertInterval.java

@@ -0,0 +1,54 @@
+// https://leetcode.com/problems/insert-interval/submissions
+// T: O(n)
+// S: O(n)
+
+public class InsertInterval {
+    public int[][] insert(int[][] intervals, int[] newInterval) {
+        if (intervals.length == 0) return new int[][] {newInterval};
+        final int startIndex = search(intervals, newInterval[0]);
+        final int endIndex = search(intervals, newInterval[1]);
+        final int newStart = startIndex >= intervals.length
+                ? newInterval[0]
+                : Math.min(intervals[startIndex][0], newInterval[0]);
+        final int newEnd = endIndex >= intervals.length
+                ? newInterval[1]
+                : newInterval[1] >= intervals[endIndex][0] ? intervals[endIndex][1] : newInterval[1];
+        final boolean hasMerged = hasMerged(intervals, newInterval, startIndex, endIndex);
+        final int intervalMergedEnd = endIndex >= intervals.length
+                ? intervals.length - 1
+                : newInterval[1] >= intervals[endIndex][0] ? endIndex : endIndex - 1;
+        final int intervalMergedStart = startIndex;
+        final int elements = intervals.length - (hasMerged ? intervalMergedEnd - intervalMergedStart : -1);
+        final int[][] result = new int[elements][2];
+        int i = 0;
+        for ( ; i < intervalMergedStart ; i++) result[i] = intervals[i];
+        result[i++] = new int[] {newStart, newEnd};
+        if (hasMerged) {
+            for (i = intervalMergedEnd + 1 ; i < intervals.length ; i++) {
+                result[i - (intervalMergedEnd - intervalMergedStart)] = intervals[i];
+            }
+        } else {
+            for ( ; i < intervals.length ; i++) {
+                result[i] = intervals[i - 1];
+            }
+        }
+        return result;
+    }
+
+    private boolean hasMerged(int[][] intervals, int[] interval, int start, int end) {
+        if (start >= intervals.length) return false;
+        return interval[0] <= intervals[start][1] ||
+                (end < intervals.length && interval[1] >= intervals[end][0]);
+    }
+
+    private int search(int[][] array, int x) {
+        int left = 0, right = array.length - 1, middle;
+        while (left <= right) {
+            middle = left + (right - left) / 2;
+            if (array[middle][1] == x) return middle;
+            else if (array[middle][1] > x) right = middle - 1;
+            else left = middle + 1;
+        }
+        return left;
+    }
+}