25537439965

Committed 08 May 2026 02:07PM UTC coverage: 99.851% (-0.1%) from 99.973%

Build # 25537439965

Build Type

push

github

Committed by

EFanZh

Commit Message

Add problem 3637: Trionic Array I

Coverage Stats

296 of 296 branches covered (100.0%)

Branch coverage included in aggregate %.

39 of 47 new or added lines in 2 files covered. (82.98%)

124456 of 124642 relevant lines covered (99.85%)

7616.67 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

78.95

/src/problem_3637_trionic_array_i/iterative.rs

pub struct Solution;

// ------------------------------------------------------ snip ------------------------------------------------------ //

use std::cmp::Ordering;

impl Solution {
    pub fn is_trionic(nums: Vec<i32>) -> bool {
        let mut iter = nums.iter().copied();

        iter.next().is_some_and(|first| {
            let Some(mut prev) = iter.next().filter(|&second| second > first) else {
                return false;
            };

            loop {
                let Some(value) = iter.next() else { return false };
                let cmp = value.cmp(&prev);

                if cmp == Ordering::Equal {
                    return false;
                }

                prev = value;

                if cmp == Ordering::Less {
                    break;
                }
            }

            loop {
                let Some(value) = iter.next() else { return false };
                let cmp = value.cmp(&prev);

                if cmp == Ordering::Equal {
                    return false;
                }

                prev = value;

                if cmp == Ordering::Greater {
                    break;
                }
            }

            iter.all(|value| {
                let result = value > prev;

                if result {
                    prev = value;
                }

                result
            })
        })
    }
}

// ------------------------------------------------------ snip ------------------------------------------------------ //

impl super::Solution for Solution {
    fn is_trionic(nums: Vec<i32>) -> bool {
        Self::is_trionic(nums)
    }
}

#[cfg(test)]
mod tests {
    #[test]
    fn test_solution() {
        super::super::tests::run::<super::Solution>();
    }
}

1	pub struct Solution;
2
3	// ------------------------------------------------------ snip ------------------------------------------------------ //
4
5	use std::cmp::Ordering;
6
7	impl Solution {
8	pub fn is_trionic(nums: Vec<i32>) -> bool {	3✔
9	let mut iter = nums.iter().copied();	3✔
10
11	iter.next().is_some_and(\|first\| {	3✔
12	let Some(mut prev) = iter.next().filter(\|&second\| second > first) else {	3✔
13	return false;	1✔
14	};
15
16	loop {
17	let Some(value) = iter.next() else { return false };	4✔
18	let cmp = value.cmp(&prev);	3✔
19
20	if cmp == Ordering::Equal {	3✔
NEW 21	return false;	×
22	}	3✔
23
24	prev = value;	3✔
25
26	if cmp == Ordering::Less {	3✔
27	break;	1✔
28	}	2✔
29	}
30
31	loop {
32	let Some(value) = iter.next() else { return false };	2✔
33	let cmp = value.cmp(&prev);	2✔
34
35	if cmp == Ordering::Equal {	2✔
NEW 36	return false;	×
37	}	2✔
38
39	prev = value;	2✔
40
41	if cmp == Ordering::Greater {	2✔
42	break;	1✔
43	}	1✔
44	}
45
46	iter.all(\|value\| {	1✔
NEW 47	let result = value > prev;	×
48
NEW 49	if result {	×
NEW 50	prev = value;	×
NEW 51	}	×
52
NEW 53	result	×
NEW 54	})	×
55	})	3✔
56	}	3✔
57	}
58
59	// ------------------------------------------------------ snip ------------------------------------------------------ //
60
61	impl super::Solution for Solution {
62	fn is_trionic(nums: Vec<i32>) -> bool {	3✔
63	Self::is_trionic(nums)	3✔
64	}	3✔
65	}
66
67	#[cfg(test)]
68	mod tests {
69	#[test]
70	fn test_solution() {	1✔
71	super::super::tests::run::<super::Solution>();	1✔
72	}	1✔
73	}

EFanZh / LeetCode / 25537439965

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous