Merge pull request #284 from hellomrsun/master

hellomrsun · web-flow · commit 1a40ddb98983 · 2020-09-13T19:58:23.000+02:00
Add Insert Interval
diff --git a/README.md b/README.md
@@ -19,6 +19,7 @@ Solutions in various programming languages are provided. Enjoy it.
 10. [Bulls and Cows](https://github.com/AlgoStudyGroup/Leetcode/tree/master/September-LeetCoding-Challenge/10-Bulls-and-Cows)
 11. [Maximum Product Subarray](https://github.com/AlgoStudyGroup/Leetcode/tree/master/September-LeetCoding-Challenge/11-Maximum-Product-Subarray)
 12. [Combination Sum III](https://github.com/AlgoStudyGroup/Leetcode/tree/master/September-LeetCoding-Challenge/12-Combination-Sum-III)
+13. [Insert Interval](https://github.com/AlgoStudyGroup/Leetcode/tree/master/September-LeetCoding-Challenge/13-Insert-Interval)
 
 ## August LeetCoding Challenge
 Click [here](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/) for problem descriptions.
diff --git a/September-LeetCoding-Challenge/13-Insert-Interval/Insert-Interval.cs b/September-LeetCoding-Challenge/13-Insert-Interval/Insert-Interval.cs
@@ -0,0 +1,23 @@
+public class Solution {
+    public int[][] Insert(int[][] intervals, int[] newInterval) {
+        var res = new List<int[]>();
+        foreach(int[] i in intervals){
+            if(newInterval == null || i[1] < newInterval[0]){
+                res.Add(i);
+            }
+            else if(i[0] > newInterval[1]){
+                res.Add(newInterval);
+                res.Add(i);
+                newInterval = null;
+            }
+            else{
+                newInterval[0] = Math.Min(newInterval[0], i[0]);
+                newInterval[1] = Math.Max(newInterval[1], i[1]);
+            }
+        }
+        if(newInterval != null){
+            res.Add(newInterval);
+        }
+        return res.ToArray();
+    }
+}
