add 057

Author: shishishu

README.md

@@ -48,4 +48,5 @@ Idx | Date | Question | Python| Java | Domain | Tag | Difficulty | Remark
 042|20200627|[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[108p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/108_Convert_Sorted_Array_to_Binary_Search_Tree.ipynb)|[108j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/108/Solution.java)|BST|Recursive|Easy
 043|20200627|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)|[109p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/109_Convert_Sorted_List_to_Binary_Search_Tree.ipynb)|[109j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/109/Solution.java)|BST|Recursive|Medium
 044|20200705|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[028p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/028_Implement_strStr().ipynb)|[028j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/028/Solution.java)|String|KMP|Easy
-045|20200816|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)|[056p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/056_Merge_Intervals.ipynb)|[056j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/056/Solution.java)|Sort||Medium
+045|20200816|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)|[056p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/056_Merge_Intervals.ipynb)|[056j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/056/Solution.java)|Sort||Medium
+046|20200816|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)|[057p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/057_Insert_Interval.ipynb)|[057j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/057/Solution.java)|Sort||Hard

images/057_Q.PNG

@@ -0,0 +1,26 @@
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+
+class Solution {
+    public int[][] insert(int[][] intervals, int[] newInterval) {
+        int start = newInterval[0];
+        int end = newInterval[1];
+        ArrayList<int[]> result = new ArrayList<>();
+        int i = 0;
+        while (i < intervals.length && intervals[i][1] < start){
+            result.add(intervals[i]);
+            i++;
+        }
+        while (i < intervals.length && intervals[i][0] <= end){
+            start = Math.min(start, intervals[i][0]);
+            end = Math.max(end, intervals[i][1]);
+            i++;
+        }
+        result.add(new int[]{start, end});
+        while (i < intervals.length){
+            result.add(intervals[i]);
+            i++;
+        }
+        return result.toArray(new int[result.size()][]);
+    }
+}

images/057_S1.PNG

@@ -49,6 +49,7 @@
       <sourceFolder url="file://$MODULE_DIR$/109" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/028" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/056" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/057" isTestSource="false" />
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />