feat: add rust solution to lc problem: No.0057 (#1556)

No.0057 Insert Interval

Author: poltao

solution/0000-0099/0057.Insert Interval/README.md

@@ -422,6 +422,67 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut merged_intervals = intervals.clone();
+        merged_intervals.push(vec![new_interval[0], new_interval[1]]);
+        // sort by elem[0]
+        merged_intervals.sort_by_key(|elem| elem[0]);
+        // merge interval
+        let mut result = vec![];
+
+        for interval in merged_intervals {
+            if result.is_empty() {
+                result.push(interval);
+                continue;
+            }
+
+            let last_elem = result.last_mut().unwrap();
+            if interval[0] > last_elem[1] {
+                result.push(interval);
+            } else {
+                last_elem[1] = last_elem[1].max(interval[1]);
+            }
+        }
+        result
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut inserted = false;
+        let mut result = vec![];
+
+        let (mut start, mut end) = (new_interval[0], new_interval[1]);
+        for iter in intervals.iter() {
+            let (cur_st, cur_ed) = (iter[0], iter[1]);
+            if cur_ed < start {
+                result.push(vec![cur_st, cur_ed]);
+            } else if cur_st > end {
+                if !inserted {
+                    inserted = true;
+                    result.push(vec![start, end]);
+                }
+                result.push(vec![cur_st, cur_ed]);
+            } else {
+                start = std::cmp::min(start, cur_st);
+                end = std::cmp::max(end, cur_ed);
+            }
+        }
+
+        if !inserted {
+            result.push(vec![start, end]);
+        }
+        result
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0057.Insert Interval/README_EN.md

@@ -376,6 +376,67 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut merged_intervals = intervals.clone();
+        merged_intervals.push(vec![new_interval[0], new_interval[1]]);
+        // sort by elem[0]
+        merged_intervals.sort_by_key(|elem| elem[0]);
+        // merge interval
+        let mut result = vec![];
+
+        for interval in merged_intervals {
+            if result.is_empty() {
+                result.push(interval);
+                continue;
+            }
+
+            let last_elem = result.last_mut().unwrap();
+            if interval[0] > last_elem[1] {
+                result.push(interval);
+            } else {
+                last_elem[1] = last_elem[1].max(interval[1]);
+            }
+        }
+        result
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut inserted = false;
+        let mut result = vec![];
+
+        let (mut start, mut end) = (new_interval[0], new_interval[1]);
+        for iter in intervals.iter() {
+            let (cur_st, cur_ed) = (iter[0], iter[1]);
+            if cur_ed < start {
+                result.push(vec![cur_st, cur_ed]);
+            } else if cur_st > end {
+                if !inserted {
+                    inserted = true;
+                    result.push(vec![start, end]);
+                }
+                result.push(vec![cur_st, cur_ed]);
+            } else {
+                start = std::cmp::min(start, cur_st);
+                end = std::cmp::max(end, cur_ed);
+            }
+        }
+
+        if !inserted {
+            result.push(vec![start, end]);
+        }
+        result
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0057.Insert Interval/Solution.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut inserted = false;
+        let mut result = vec![];
+
+        let (mut start, mut end) = (new_interval[0], new_interval[1]);
+        for iter in intervals.iter() {
+            let (cur_st, cur_ed) = (iter[0], iter[1]);
+            if cur_ed < start {
+                result.push(vec![cur_st, cur_ed]);
+            } else if cur_st > end {
+                if !inserted {
+                    inserted = true;
+                    result.push(vec![start, end]);
+                }
+                result.push(vec![cur_st, cur_ed]);
+            } else {
+                start = std::cmp::min(start, cur_st);
+                end = std::cmp::max(end, cur_ed);
+            }
+        }
+
+        if !inserted {
+            result.push(vec![start, end]);
+        }
+        result
+    }
+}