Maximum number of non overlapping subarrays with sum equals target

#[test]
fn t1() {
    let start = std::time::Instant::now();
    let val = Solution::max_non_overlapping(vec![1, 1, 1, 1, 1], 2);
    let expected = 2;
    log_result!(val == expected, "t1", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t2() {
    let start = std::time::Instant::now();
    let val = Solution::max_non_overlapping(vec![-1, 3, 5, 1, 4, 2, -9], 6);
    let expected = 2;
    log_result!(val == expected, "t2", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t3() {
    let start = std::time::Instant::now();
    let val = Solution::max_non_overlapping(vec![1, 2, 3], 3);
    let expected = 2;
    log_result!(val == expected, "t3", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t4() {
    let start = std::time::Instant::now();
    let val = Solution::max_non_overlapping(vec![1, 1, 1], 1);
    let expected = 3;
    log_result!(val == expected, "t4", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t5() {
    let start = std::time::Instant::now();
    let val = Solution::max_non_overlapping(vec![0], 0);
    let expected = 1;
    log_result!(val == expected, "t5", start, &expected, &val);
    assert_eq!(val, expected);
}