feat: add solutions to lc problem: No.2395

No.2395.Find Subarrays With Equal Sum

Author: YangFong

solution/2300-2399/2395.Find Subarrays With Equal Sum/README.md

@@ -143,6 +143,39 @@ function findSubarrays(nums: number[]): boolean {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn find_subarrays(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut set = HashSet::new();
+        for i in 1..n {
+            if !set.insert(nums[i - 1] + nums[i]) {
+                return true;
+            }
+        }
+        false
+    }
+}
+```
+
+### **C**
+
+```c
+bool findSubarrays(int *nums, int numsSize) {
+    for (int i = 1; i < numsSize - 1; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i - 1] + nums[i] == nums[j - 1] + nums[j]) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+```
+
 ### **...**
 
 ```

solution/2300-2399/2395.Find Subarrays With Equal Sum/README_EN.md

@@ -128,6 +128,39 @@ function findSubarrays(nums: number[]): boolean {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn find_subarrays(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut set = HashSet::new();
+        for i in 1..n {
+            if !set.insert(nums[i - 1] + nums[i]) {
+                return true;
+            }
+        }
+        false
+    }
+}
+```
+
+### **C**
+
+```c
+bool findSubarrays(int *nums, int numsSize) {
+    for (int i = 1; i < numsSize - 1; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i - 1] + nums[i] == nums[j - 1] + nums[j]) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+```
+
 ### **...**
 
 ```

solution/2300-2399/2395.Find Subarrays With Equal Sum/Solution.c

@@ -0,0 +1,10 @@
+bool findSubarrays(int *nums, int numsSize) {
+    for (int i = 1; i < numsSize - 2; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i - 1] + nums[i] == nums[j - 1] + nums[j]) {
+                return true;
+            }
+        }
+    }
+    return false;
+}

solution/2300-2399/2395.Find Subarrays With Equal Sum/Solution.rs

@@ -0,0 +1,13 @@
+use std::collections::HashSet;
+impl Solution {
+    pub fn find_subarrays(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut set = HashSet::new();
+        for i in 1..n {
+            if !set.insert(nums[i - 1] + nums[i]) {
+                return true;
+            }
+        }
+        false
+    }
+}