competitive::combinatorial_optimization

Function levenshtein_distance

Source 
pub fn levenshtein_distance<T: PartialEq>(x: &[T], y: &[T]) -> usize
Examples found in repository?
crates/aizu_online_judge/src/dpl/dpl_1_e.rs (line 10)
6pub fn dpl_1_e(reader: impl Read, mut writer: impl Write) {
7    let s = read_all_unchecked(reader);
8    let mut scanner = Scanner::new(&s);
9    scan!(scanner, s1: Chars, s2: Chars);
10    writeln!(writer, "{}", levenshtein_distance(&s1, &s2)).ok();
11}