0953-verifying-an-alien-dictionary.rs

use std::collections::HashMap;
impl Solution {
       pub fn is_alien_sorted(words: Vec<String>, order: String) -> bool {
        let n = words.len();
        let mut map = HashMap::new();

        order.as_bytes().iter().enumerate().for_each(|(i, &v)| {
            map.insert(v, i);
        });

        for i in 1..n {
            let s1 = words[i - 1].as_bytes();
            let s2 = words[i].as_bytes();

            let mut is_equal = true;

            for i in 0..s1.len().min(s2.len()) {
                if map.get(&s1[i]) > map.get(&s2[i]) {
                    return false;
                }

                if map.get(&s1[i]) < map.get(&s2[i]) {
                    is_equal = false;
                    break;
                }
            }

            if is_equal && s1.len() > s2.len() {
                return false;
            }
        }
        true
    }
}