Add Rust solution for Largest Divisible Subset.

Author: yanglbme

solution/0300-0399/0368.Largest Divisible Subset/README.md

@@ -235,6 +235,45 @@ function largestDivisibleSubset(nums: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn largest_divisible_subset(nums: Vec<i32>) -> Vec<i32> {
+        let mut nums = nums;
+        nums.sort();
+        
+        let n = nums.len();
+        let mut f = vec![1; n];
+        let mut k = 0;
+        
+        for i in 0..n {
+            for j in 0..i {
+                if nums[i] % nums[j] == 0 {
+                    f[i] = f[i].max(f[j] + 1);
+                }
+            }
+            if f[k] < f[i] {
+                k = i;
+            }
+        }
+        
+        let mut m = f[k];
+        let mut ans = Vec::new();
+        
+        for i in (0..=k).rev() {
+            if nums[k] % nums[i] == 0 && f[i] == m {
+                ans.push(nums[i]);
+                k = i;
+                m -= 1;
+            }
+        }
+        
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0300-0399/0368.Largest Divisible Subset/README_EN.md

@@ -223,6 +223,45 @@ function largestDivisibleSubset(nums: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn largest_divisible_subset(nums: Vec<i32>) -> Vec<i32> {
+        let mut nums = nums;
+        nums.sort();
+        
+        let n = nums.len();
+        let mut f = vec![1; n];
+        let mut k = 0;
+        
+        for i in 0..n {
+            for j in 0..i {
+                if nums[i] % nums[j] == 0 {
+                    f[i] = f[i].max(f[j] + 1);
+                }
+            }
+            if f[k] < f[i] {
+                k = i;
+            }
+        }
+        
+        let mut m = f[k];
+        let mut ans = Vec::new();
+        
+        for i in (0..=k).rev() {
+            if nums[k] % nums[i] == 0 && f[i] == m {
+                ans.push(nums[i]);
+                k = i;
+                m -= 1;
+            }
+        }
+        
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0300-0399/0368.Largest Divisible Subset/Solution.rs

@@ -0,0 +1,34 @@
+impl Solution {
+    pub fn largest_divisible_subset(nums: Vec<i32>) -> Vec<i32> {
+        let mut nums = nums;
+        nums.sort();
+        
+        let n = nums.len();
+        let mut f = vec![1; n];
+        let mut k = 0;
+        
+        for i in 0..n {
+            for j in 0..i {
+                if nums[i] % nums[j] == 0 {
+                    f[i] = f[i].max(f[j] + 1);
+                }
+            }
+            if f[k] < f[i] {
+                k = i;
+            }
+        }
+        
+        let mut m = f[k];
+        let mut ans = Vec::new();
+        
+        for i in (0..=k).rev() {
+            if nums[k] % nums[i] == 0 && f[i] == m {
+                ans.push(nums[i]);
+                k = i;
+                m -= 1;
+            }
+        }
+        
+        ans
+    }
+}