Skip to main content

rustgym/leetcode/
_523_continuous_subarray_sum.rs

1struct Solution;
2use std::collections::HashSet;
3
4impl Solution {
5    fn check_subarray_sum(nums: Vec<i32>, k: i32) -> bool {
6        let n = nums.len();
7        let mut sum = 0;
8        let mut pre = 0;
9        let mut hs: HashSet<i32> = HashSet::new();
10        for i in 0..n {
11            sum += nums[i];
12            let cur = if k == 0 { sum } else { sum % k };
13            if hs.contains(&cur) {
14                return true;
15            }
16            hs.insert(pre);
17            pre = cur;
18        }
19        false
20    }
21}
22
23#[test]
24fn test() {
25    let nums = vec![23, 2, 4, 6, 7];
26    let k = 6;
27    let res = true;
28    assert_eq!(Solution::check_subarray_sum(nums, k), res);
29    let nums = vec![23, 2, 6, 4, 7];
30    let k = 6;
31    let res = true;
32    assert_eq!(Solution::check_subarray_sum(nums, k), res);
33    let nums = vec![23, 2, 6, 4, 7];
34    let k = 0;
35    let res = false;
36    assert_eq!(Solution::check_subarray_sum(nums, k), res);
37    let nums = vec![0, 0];
38    let k = -1;
39    let res = true;
40    assert_eq!(Solution::check_subarray_sum(nums, k), res);
41}