feat: add rust solution to lc problem: No.1708 (#1248)

Author: xzhseh

solution/1700-1799/1708.Largest Subarray Length K/README.md

@@ -113,6 +113,30 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn largest_subarray(nums: Vec<i32>, k: i32) -> Vec<i32> {
+        let mut ret_vec = vec![i32::MIN];
+        let n = nums.len();
+
+        if n == k as usize {
+            return nums;
+        }
+
+        for i in 0..=n - k as usize {
+            if nums[i] > ret_vec[0] {
+                ret_vec = nums[i..i + k as usize].to_vec();
+            }
+        }
+
+        ret_vec
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/1700-1799/1708.Largest Subarray Length K/README_EN.md

@@ -100,6 +100,30 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn largest_subarray(nums: Vec<i32>, k: i32) -> Vec<i32> {
+        let mut ret_vec = vec![i32::MIN];
+        let n = nums.len();
+
+        if n == k as usize {
+            return nums;
+        }
+
+        for i in 0..=n - k as usize {
+            if nums[i] > ret_vec[0] {
+                ret_vec = nums[i..i + k as usize].to_vec();
+            }
+        }
+
+        ret_vec
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/1700-1799/1708.Largest Subarray Length K/Solution.rs

@@ -0,0 +1,19 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn largest_subarray(nums: Vec<i32>, k: i32) -> Vec<i32> {
+        let mut ret_vec = vec![i32::MIN];
+        let n = nums.len();
+
+        if n == k as usize {
+            return nums;
+        }
+
+        for i in 0..=n - k as usize {
+            if nums[i] > ret_vec[0] {
+                ret_vec = nums[i..i + k as usize].to_vec();
+            }
+        }
+
+        ret_vec
+    }
+}