feat: add rust solution to lc problem: No.0560

No.0560.Subarray Sum Equals K

Author: YangFong

solution/0500-0599/0560.Subarray Sum Equals K/README.md

@@ -128,6 +128,49 @@ func subarraySum(nums []int, k int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn subarray_sum(mut nums: Vec<i32>, k: i32) -> i32 {
+        let n = nums.len();
+        let mut count = 0;
+        for i in 0..n {
+            let num = nums[i];
+            if num == k {
+                count += 1;
+            }
+            for j in 0..i {
+                nums[j] += num;
+                if nums[j] == k {
+                    count += 1;
+                }
+            }
+        }
+        count
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
+        let mut res = 0;
+        let mut sum = 0;
+        let mut map = HashMap::new();
+        map.insert(0, 1);
+        nums.iter().for_each(|num| {
+            sum += num;
+            res += map.get(&(sum - k)).unwrap_or(&0);
+            map.insert(sum, map.get(&sum).unwrap_or(&0) + 1);
+        });
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0560.Subarray Sum Equals K/README_EN.md

@@ -111,6 +111,49 @@ func subarraySum(nums []int, k int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn subarray_sum(mut nums: Vec<i32>, k: i32) -> i32 {
+        let n = nums.len();
+        let mut count = 0;
+        for i in 0..n {
+            let num = nums[i];
+            if num == k {
+                count += 1;
+            }
+            for j in 0..i {
+                nums[j] += num;
+                if nums[j] == k {
+                    count += 1;
+                }
+            }
+        }
+        count
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
+        let mut res = 0;
+        let mut sum = 0;
+        let mut map = HashMap::new();
+        map.insert(0, 1);
+        nums.iter().for_each(|num| {
+            sum += num;
+            res += map.get(&(sum - k)).unwrap_or(&0);
+            map.insert(sum, map.get(&sum).unwrap_or(&0) + 1);
+        });
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0560.Subarray Sum Equals K/Solution.rs

@@ -0,0 +1,16 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
+        let mut res = 0;
+        let mut sum = 0;
+        let mut map = HashMap::new();
+        map.insert(0, 1);
+        nums.iter().for_each(|num| {
+            sum += num;
+            res += map.get(&(sum - k)).unwrap_or(&0);
+            map.insert(sum, map.get(&sum).unwrap_or(&0) + 1);
+        });
+        res
+    }
+}