feat: add solutions to lc problem: No.0056

No.0056.Merge Intervals

Author: YangFong

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

@@ -134,6 +134,25 @@ function merge(intervals: number[][]): number[][] {
 }
 ```
 
+```ts
+function merge(intervals: number[][]): number[][] {
+    intervals.sort((a, b) => a[0] - b[0]);
+    const n = intervals.length;
+    const res = [];
+    let i = 0;
+    while (i < n) {
+        let [l, r] = intervals[i];
+        i++;
+        while (i < n && r >= intervals[i][0]) {
+            r = Math.max(r, intervals[i][1]);
+            i++;
+        }
+        res.push([l, r]);
+    }
+    return res;
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -233,6 +252,30 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        intervals.sort_unstable_by(|a, b| a[0].cmp(&b[0]));
+        let n = intervals.len();
+        let mut res = vec![];
+        let mut i = 0;
+        while i < n {
+            let l = intervals[i][0];
+            let mut r = intervals[i][1];
+            i += 1;
+            while i < n && r >= intervals[i][0] {
+                r = r.max(intervals[i][1]);
+                i += 1;
+            }
+            res.push(vec![l, r]);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -104,6 +104,25 @@ function merge(intervals: number[][]): number[][] {
 }
 ```
 
+```ts
+function merge(intervals: number[][]): number[][] {
+    intervals.sort((a, b) => a[0] - b[0]);
+    const n = intervals.length;
+    const res = [];
+    let i = 0;
+    while (i < n) {
+        let [l, r] = intervals[i];
+        i++;
+        while (i < n && r >= intervals[i][0]) {
+            r = Math.max(r, intervals[i][1]);
+            i++;
+        }
+        res.push([l, r]);
+    }
+    return res;
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -203,6 +222,30 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        intervals.sort_unstable_by(|a, b| a[0].cmp(&b[0]));
+        let n = intervals.len();
+        let mut res = vec![];
+        let mut i = 0;
+        while i < n {
+            let l = intervals[i][0];
+            let mut r = intervals[i][1];
+            i += 1;
+            while i < n && r >= intervals[i][0] {
+                r = r.max(intervals[i][1]);
+                i += 1;
+            }
+            res.push(vec![l, r]);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,19 @@
+impl Solution {
+    pub fn merge(mut intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        intervals.sort_unstable_by(|a, b| a[0].cmp(&b[0]));
+        let n = intervals.len();
+        let mut res = vec![];
+        let mut i = 0;
+        while i < n {
+            let l = intervals[i][0];
+            let mut r = intervals[i][1];
+            i += 1;
+            while i < n && r >= intervals[i][0] {
+                r = r.max(intervals[i][1]);
+                i += 1;
+            }
+            res.push(vec![l, r]);
+        }
+        res
+    }
+}