974. Subarray Sums Divisible by K Medium

1/**
2 * [974] Subarray Sums Divisible by K
3 *
4 * Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.
5 * A subarray is a contiguous part of an array.
6 *  
7 * Example 1:
8 * 
9 * Input: nums = [4,5,0,-2,-3,1], k = 5
10 * Output: 7
11 * Explanation: There are 7 subarrays with a sum divisible by k = 5:
12 * [4, 5, 0, -2, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], [-2, -3]
13 * 
14 * Example 2:
15 * 
16 * Input: nums = [5], k = 9
17 * Output: 0
18 * 
19 *  
20 * Constraints:
21 * 
22 * 	1 <= nums.length <= 3 * 10^4
23 * 	-10^4 <= nums[i] <= 10^4
24 * 	2 <= k <= 10^4
25 * 
26 */
27pub struct Solution {}
28
29// problem: https://leetcode.com/problems/subarray-sums-divisible-by-k/
30// discuss: https://leetcode.com/problems/subarray-sums-divisible-by-k/discuss/?currentPage=1&orderBy=most_votes&query=
31
32// submission codes start here
33
34impl Solution {
35    pub fn subarrays_div_by_k(nums: Vec<i32>, k: i32) -> i32 {
36        0
37    }
38}
39
40// submission codes end
41
42#[cfg(test)]
43mod tests {
44    use super::*;
45
46    #[test]
47    fn test_974() {
48    }
49}
50