feat: add rust soluiton to lc problem: No.2436

Author: yanglbme

solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README.md

@@ -187,6 +187,33 @@ function gcd(a: number, b: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn minimum_splits(nums: Vec<i32>) -> i32 {
+        let mut ans = 1;
+        let mut g = 0;
+        for &x in &nums {
+            g = Self::gcd(g, x);
+            if g == 1 {
+                ans += 1;
+                g = x;
+            }
+        }
+        ans
+    }
+
+    fn gcd(a: i32, b: i32) -> i32 {
+        if b == 0 {
+            a
+        } else {
+            Self::gcd(b, a % b)
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README_EN.md

@@ -183,6 +183,33 @@ function gcd(a: number, b: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn minimum_splits(nums: Vec<i32>) -> i32 {
+        let mut ans = 1;
+        let mut g = 0;
+        for &x in &nums {
+            g = Self::gcd(g, x);
+            if g == 1 {
+                ans += 1;
+                g = x;
+            }
+        }
+        ans
+    }
+
+    fn gcd(a: i32, b: i32) -> i32 {
+        if b == 0 {
+            a
+        } else {
+            Self::gcd(b, a % b)
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/Solution.rs

@@ -0,0 +1,22 @@
+impl Solution {
+    pub fn minimum_splits(nums: Vec<i32>) -> i32 {
+        let mut ans = 1;
+        let mut g = 0;
+        for &x in &nums {
+            g = Self::gcd(g, x);
+            if g == 1 {
+                ans += 1;
+                g = x;
+            }
+        }
+        ans
+    }
+
+    fn gcd(a: i32, b: i32) -> i32 {
+        if b == 0 {
+            a
+        } else {
+            Self::gcd(b, a % b)
+        }
+    }
+}