feat: add rust solution to lc problem: No.2717 (#1049)

Author: dierbei

Diff for: solution/2700-2799/2717.Semi-Ordered Permutation/README.md

@@ -161,6 +161,51 @@ function semiOrderedPermutation(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut j = 0;
+        let mut n = nums.len();
+
+        for idx in 0..n {
+            if nums[idx] == 1 {
+                i = idx;
+            }
+            if nums[idx] == n as i32 {
+                j = idx;
+            }
+        }
+
+        let mut ans = i - 1 + n - j;
+        if i > j {
+            ans = i - 1 + n - j - 1;
+        }
+
+        ans as i32
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let i = nums.iter().enumerate().find(|&(_, &v)| v == 1).map(|(i, _)| i).unwrap();
+        let j = nums.iter().enumerate().find(|&(_, &v)| v == n as i32).map(|(i, _)| i).unwrap();
+
+        let mut ans = i - 1 + n - j;
+        if i > j {
+            ans = i - 1 + n - j  - 1;
+        }
+
+        ans as i32
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/2700-2799/2717.Semi-Ordered Permutation/README_EN.md

@@ -143,6 +143,51 @@ function semiOrderedPermutation(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut j = 0;
+        let mut n = nums.len();
+
+        for idx in 0..n {
+            if nums[idx] == 1 {
+                i = idx;
+            }
+            if nums[idx] == n as i32 {
+                j = idx;
+            }
+        }
+
+        let mut ans = i - 1 + n - j;
+        if i > j {
+            ans = i - 1 + n - j - 1;
+        }
+
+        ans as i32
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let i = nums.iter().enumerate().find(|&(_, &v)| v == 1).map(|(i, _)| i).unwrap();
+        let j = nums.iter().enumerate().find(|&(_, &v)| v == n as i32).map(|(i, _)| i).unwrap();
+
+        let mut ans = i - 1 + n - j;
+        if i > j {
+            ans = i - 1 + n - j  - 1;
+        }
+
+        ans as i32
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/2700-2799/2717.Semi-Ordered Permutation/Solution.rs

@@ -0,0 +1,14 @@
+impl Solution {
+    pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let i = nums.iter().enumerate().find(|&(_, &v)| v == 1).map(|(i, _)| i).unwrap();
+        let j = nums.iter().enumerate().find(|&(_, &v)| v == n as i32).map(|(i, _)| i).unwrap();
+
+        let mut ans = i - 1 + n - j;
+        if i > j {
+            ans = i - 1 + n - j  - 1;
+        }
+
+        ans as i32
+    }
+}