Longest strictly increasing or strictly decreasing subarray

#[test]
fn t1() {
    let start = std::time::Instant::now();
    let val = Solution::longest_monotonic_subarray(vec![1, 4, 3, 3, 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::longest_monotonic_subarray(vec![3, 3, 3, 3]);
    let expected = 1;
    log_result!(val == expected, "t2", start, &expected, &val);
    assert_eq!(val, expected);
}

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

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

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

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

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