feat: add rust solution to lc problem: No.0969

No.0969.Pancake Sorting

Author: YangFong

solution/0900-0999/0969.Pancake Sorting/README.md

@@ -205,6 +205,33 @@ func pancakeSort(arr []int) []int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn pancake_sort(mut arr: Vec<i32>) -> Vec<i32> {
+        let mut res = vec![];
+        for n in (1..arr.len()).rev() {
+            let mut max_idx = 0;
+            for idx in 0..=n {
+                if arr[max_idx] < arr[idx] {
+                    max_idx = idx;
+                }
+            }
+            if max_idx != n {
+                if max_idx != 0 {
+                    arr[..=max_idx].reverse();
+                    res.push(max_idx as i32 + 1);
+                }
+                arr[..=n].reverse();
+                res.push(n as i32 + 1);
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0969.Pancake Sorting/README_EN.md

@@ -194,6 +194,33 @@ func pancakeSort(arr []int) []int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn pancake_sort(mut arr: Vec<i32>) -> Vec<i32> {
+        let mut res = vec![];
+        for n in (1..arr.len()).rev() {
+            let mut max_idx = 0;
+            for idx in 0..=n {
+                if arr[max_idx] < arr[idx] {
+                    max_idx = idx;
+                }
+            }
+            if max_idx != n {
+                if max_idx != 0 {
+                    arr[..=max_idx].reverse();
+                    res.push(max_idx as i32 + 1);
+                }
+                arr[..=n].reverse();
+                res.push(n as i32 + 1);
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0969.Pancake Sorting/Solution.rs

@@ -0,0 +1,22 @@
+impl Solution {
+    pub fn pancake_sort(mut arr: Vec<i32>) -> Vec<i32> {
+        let mut res = vec![];
+        for n in (1..arr.len()).rev() {
+            let mut max_idx = 0;
+            for idx in 0..=n {
+                if arr[max_idx] < arr[idx] {
+                    max_idx = idx;
+                }
+            }
+            if max_idx != n {
+                if max_idx != 0 {
+                    arr[..=max_idx].reverse();
+                    res.push(max_idx as i32 + 1);
+                }
+                arr[..=n].reverse();
+                res.push(n as i32 + 1);
+            }
+        }
+        res
+    }
+}