feat: add solutions to lc problems: No.0056,0057 (doocs#1530)

* No.0056.Merge Intervals
* No.0057.Insert Interval

Author: yanglbme

solution/0000-0099/0056.Merge Intervals/README.md

@@ -243,6 +243,24 @@ public class Solution {
 }
 ```
 
+```cs
+public class Solution {
+    public int[][] Merge(int[][] intervals) {
+        intervals = intervals.OrderBy(a => a[0]).ToArray();
+        var ans = new List<int[]>();
+        ans.Add(intervals[0]);
+        for (int i = 1; i < intervals.Length; ++i) {
+            if (ans[ans.Count - 1][1] < intervals[i][0]) {
+                ans.Add(intervals[i]);
+            } else {
+                ans[ans.Count - 1][1] = Math.Max(ans[ans.Count - 1][1], intervals[i][1]);
+            }
+        }
+        return ans.ToArray();
+    }
+}
+```
+
 ### **TypeScript**
 
 ```ts

solution/0000-0099/0056.Merge Intervals/README_EN.md

@@ -219,6 +219,24 @@ public class Solution {
 }
 ```
 
+```cs
+public class Solution {
+    public int[][] Merge(int[][] intervals) {
+        intervals = intervals.OrderBy(a => a[0]).ToArray();
+        var ans = new List<int[]>();
+        ans.Add(intervals[0]);
+        for (int i = 1; i < intervals.Length; ++i) {
+            if (ans[ans.Count - 1][1] < intervals[i][0]) {
+                ans.Add(intervals[i]);
+            } else {
+                ans[ans.Count - 1][1] = Math.Max(ans[ans.Count - 1][1], intervals[i][1]);
+            }
+        }
+        return ans.ToArray();
+    }
+}
+```
+
 ### **TypeScript**
 
 ```ts

solution/0000-0099/0056.Merge Intervals/Solution.cpp

@@ -2,18 +2,15 @@ class Solution {
 public:
     vector<vector<int>> merge(vector<vector<int>>& intervals) {
         sort(intervals.begin(), intervals.end());
-        int st = intervals[0][0], ed = intervals[0][1];
         vector<vector<int>> ans;
+        ans.emplace_back(intervals[0]);
         for (int i = 1; i < intervals.size(); ++i) {
-            if (ed < intervals[i][0]) {
-                ans.push_back({st, ed});
-                st = intervals[i][0];
-                ed = intervals[i][1];
+            if (ans.back()[1] < intervals[i][0]) {
+                ans.emplace_back(intervals[i]);
             } else {
-                ed = max(ed, intervals[i][1]);
+                ans.back()[1] = max(ans.back()[1], intervals[i][1]);
             }
         }
-        ans.push_back({st, ed});
         return ans;
     }
 };

solution/0000-0099/0056.Merge Intervals/Solution.cs

@@ -1,18 +1,15 @@
-public class Solution {
-    public int[][] Merge(int[][] intervals) {
-        intervals = intervals.OrderBy(a => a[0]).ToArray();
-        int st = intervals[0][0], ed = intervals[0][1];
-        var ans = new List<int[]>();
-        for (int i = 1; i < intervals.Length; ++i) {
-            if (ed < intervals[i][0]) {
-                ans.Add(new int[] { st, ed });
-                st = intervals[i][0];
-                ed = intervals[i][1];
-            } else {
-                ed = Math.Max(ed, intervals[i][1]);
-            }
-        }
-        ans.Add(new int[] { st, ed });
-        return ans.ToArray();
-    }
+public class Solution {
+    public int[][] Merge(int[][] intervals) {
+        intervals = intervals.OrderBy(a => a[0]).ToArray();
+        var ans = new List<int[]>();
+        ans.Add(intervals[0]);
+        for (int i = 1; i < intervals.Length; ++i) {
+            if (ans[ans.Count - 1][1] < intervals[i][0]) {
+                ans.Add(intervals[i]);
+            } else {
+                ans[ans.Count - 1][1] = Math.Max(ans[ans.Count - 1][1], intervals[i][1]);
+            }
+        }
+        return ans.ToArray();
+    }
 }

solution/0000-0099/0056.Merge Intervals/Solution.go

@@ -1,16 +1,19 @@
 func merge(intervals [][]int) (ans [][]int) {
-	sort.Slice(intervals, func(i, j int) bool {
-		return intervals[i][0] < intervals[j][0]
-	})
-	st, ed := intervals[0][0], intervals[0][1]
+	sort.Slice(intervals, func(i, j int) bool { return intervals[i][0] < intervals[j][0] })
+	ans = append(ans, intervals[0])
 	for _, e := range intervals[1:] {
-		if ed < e[0] {
-			ans = append(ans, []int{st, ed})
-			st, ed = e[0], e[1]
-		} else if ed < e[1] {
-			ed = e[1]
+		if ans[len(ans)-1][1] < e[0] {
+			ans = append(ans, e)
+		} else {
+			ans[len(ans)-1][1] = max(ans[len(ans)-1][1], e[1])
 		}
 	}
-	ans = append(ans, []int{st, ed})
-	return ans
+	return
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
 }

solution/0000-0099/0056.Merge Intervals/Solution.java

@@ -1,19 +1,16 @@
-class Solution {
-    public int[][] merge(int[][] intervals) {
-        Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
-        int st = intervals[0][0], ed = intervals[0][1];
-        List<int[]> ans = new ArrayList<>();
-        for (int i = 1; i < intervals.length; ++i) {
-            int s = intervals[i][0], e = intervals[i][1];
-            if (ed < s) {
-                ans.add(new int[] {st, ed});
-                st = s;
-                ed = e;
-            } else {
-                ed = Math.max(ed, e);
-            }
-        }
-        ans.add(new int[] {st, ed});
-        return ans.toArray(new int[ans.size()][]);
-    }
+class Solution {
+    public int[][] merge(int[][] intervals) {
+        Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
+        List<int[]> ans = new ArrayList<>();
+        ans.add(intervals[0]);
+        for (int i = 1; i < intervals.length; ++i) {
+            int s = intervals[i][0], e = intervals[i][1];
+            if (ans.get(ans.size() - 1)[1] < s) {
+                ans.add(intervals[i]);
+            } else {
+                ans.get(ans.size() - 1)[1] = Math.max(ans.get(ans.size() - 1)[1], e);
+            }
+        }
+        return ans.toArray(new int[ans.size()][]);
+    }
 }

solution/0000-0099/0056.Merge Intervals/Solution.py

@@ -1,13 +1,10 @@
 class Solution:
     def merge(self, intervals: List[List[int]]) -> List[List[int]]:
         intervals.sort()
-        ans = []
-        st, ed = intervals[0]
+        ans = [intervals[0]]
         for s, e in intervals[1:]:
-            if ed < s:
-                ans.append([st, ed])
-                st, ed = s, e
+            if ans[-1][1] < s:
+                ans.append([s, e])
             else:
-                ed = max(ed, e)
-        ans.append([st, ed])
+                ans[-1][1] = max(ans[-1][1], e)
         return ans

solution/0000-0099/0056.Merge Intervals/Solution.ts

@@ -1,15 +1,12 @@
 function merge(intervals: number[][]): number[][] {
     intervals.sort((a, b) => a[0] - b[0]);
-    const ans: number[][] = [];
-    let [st, ed] = intervals[0];
-    for (const [s, e] of intervals.slice(1)) {
-        if (ed < s) {
-            ans.push([st, ed]);
-            [st, ed] = [s, e];
+    const ans: number[][] = [intervals[0]];
+    for (let i = 1; i < intervals.length; ++i) {
+        if (ans.at(-1)[1] < intervals[i][0]) {
+            ans.push(intervals[i]);
         } else {
-            ed = Math.max(ed, e);
+            ans.at(-1)[1] = Math.max(ans.at(-1)[1], intervals[i][1]);
         }
     }
-    ans.push([st, ed]);
     return ans;
 }