feat: add rust solution to lc problem: No.60 (doocs#2106)

Author: herschel-ma

solution/0000-0099/0060.Permutation Sequence/README.md

@@ -207,6 +207,40 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn get_permutation(n: i32, k: i32) -> String {
+        let mut k = k;
+        let mut ans = String::new();
+        let mut fact = vec![1; n as usize];
+        for i in 1..n as usize {
+            fact[i] = fact[i - 1] * (i as i32);
+        }
+        let mut vis = vec![false; n as usize + 1];
+
+        for i in 0..n as usize {
+            let cnt = fact[(n as usize) - i - 1];
+            for j in 1..=n {
+                if vis[j as usize] {
+                    continue;
+                }
+                if k > cnt {
+                    k -= cnt;
+                } else {
+                    ans.push_str(&j.to_string());
+                    vis[j as usize] = true;
+                    break;
+                }
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0060.Permutation Sequence/README_EN.md

@@ -186,6 +186,40 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn get_permutation(n: i32, k: i32) -> String {
+        let mut k = k;
+        let mut ans = String::new();
+        let mut fact = vec![1; n as usize];
+        for i in 1..n as usize {
+            fact[i] = fact[i - 1] * (i as i32);
+        }
+        let mut vis = vec![false; n as usize + 1];
+
+        for i in 0..n as usize {
+            let cnt = fact[(n as usize) - i - 1];
+            for j in 1..=n {
+                if vis[j as usize] {
+                    continue;
+                }
+                if k > cnt {
+                    k -= cnt;
+                } else {
+                    ans.push_str(&j.to_string());
+                    vis[j as usize] = true;
+                    break;
+                }
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0060.Permutation Sequence/Solution.rs

@@ -0,0 +1,29 @@
+impl Solution {
+    pub fn get_permutation(n: i32, k: i32) -> String {
+        let mut k = k;
+        let mut ans = String::new();
+        let mut fact = vec![1; n as usize];
+        for i in 1..n as usize {
+            fact[i] = fact[i - 1] * (i as i32);
+        }
+        let mut vis = vec![false; n as usize + 1];
+
+        for i in 0..n as usize {
+            let cnt = fact[(n as usize) - i - 1];
+            for j in 1..=n {
+                if vis[j as usize] {
+                    continue;
+                }
+                if k > cnt {
+                    k -= cnt;
+                } else {
+                    ans.push_str(&j.to_string());
+                    vis[j as usize] = true;
+                    break;
+                }
+            }
+        }
+
+        ans
+    }
+}