a0949_largest_time_for_given_digits.rs

/*
 * [0949] largest-time-for-given-digits
 */

pubstructSolution{}

// solution impl starts here

implSolution{
pubfnlargest_time_from_digits(a:Vec<i32>) -> String{
letmut a = a;
 a.sort();
 a.reverse();
for i in0..4{
if a[i] > 2{
continue;
}

for j in0..4{
if j == i || (a[i] == 2 && a[j] > 3){
continue;
}

for k in0..4{
if k == i || k == j || a[k] > 5{
continue;
}

returnformat!("{}{}:{}{}", a[i], a[j], a[k], a[6 - i - j - k]);
}
}
}
"".to_string()
}
}

// solution impl ends here

// solution tests starts here

#[cfg(test)]
mod tests {
usesuper::*;

#[test]
fntest_case0(){
assert_eq!(
Solution::largest_time_from_digits(vec![1,2,3,4]),
"23:41"
);
assert_eq!(Solution::largest_time_from_digits(vec![5,5,5,5]),"");
}
}

// solution tests ends here