560. Subarray Sum Equals K Medium

1/**
2 * [560] Subarray Sum Equals K
3 *
4 * Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
5 * A subarray is a contiguous non-empty sequence of elements within an array.
6 *  
7 * Example 1:
8 * Input: nums = [1,1,1], k = 2
9 * Output: 2
10 * Example 2:
11 * Input: nums = [1,2,3], k = 3
12 * Output: 2
13 *  
14 * Constraints:
15 * 
16 * 	1 <= nums.length <= 2 * 10^4
17 * 	-1000 <= nums[i] <= 1000
18 * 	-10^7 <= k <= 10^7
19 * 
20 */
21pub struct Solution {}
22
23// problem: https://leetcode.com/problems/subarray-sum-equals-k/
24// discuss: https://leetcode.com/problems/subarray-sum-equals-k/discuss/?currentPage=1&orderBy=most_votes&query=
25
26// submission codes start here
27
28impl Solution {
29    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
30        0
31    }
32}
33
34// submission codes end
35
36#[cfg(test)]
37mod tests {
38    use super::*;
39
40    #[test]
41    fn test_560() {
42    }
43}
44