LeetCode每日一题(745. Prefix and Suffix Search)

Design a special dictionary with some words that searchs the words in it by a prefix and a suffix.

Implement the WordFilter class:

WordFilter(string[] words) Initializes the object with the words in the dictionary.
f(string prefix, string suffix) Returns the index of the word in the dictionary, which has the prefix prefix and the suffix suffix. If there is more than one valid index, return the largest of them. If there is no such word in the dictionary, return -1.

Example 1:

Input
[“WordFilter”, “f”] > [[[“apple”]], [“a”, “e”]]
Output
[null, 0]

Explanation
WordFilter wordFilter = new WordFilter([“apple”]);
wordFilter.f(“a”, “e”); // return 0, because the word at index 0 has prefix = “a” and suffix = 'e".

Constraints:

• 1 <= words.length <= 15000
• 1 <= words[i].length <= 10
• 1 <= prefix.length, suffix.length <= 10
• words[i], prefix and suffix consist of lower-case English letters only.
• At most 15000 calls will be made to the function f.

---

把每个单词按字母处理成 suffix#prefix 组合形式, 然后就可以进行查询了， 查询时时间复杂度为 O(1), 这里要注意的是，每个 suffix#prefix 的 key 仅需要对应一个最大的 index 就好了， 因为查询就是这么要求的

---

use std::collections::HashMap;

struct WordFilter {
    m: HashMap<String, i32>,
}

/**
 * `&self` means the method takes an immutable reference.
 * If you need a mutable reference, change it to `&mut self` instead.
 */
impl WordFilter {
    fn new(words: Vec<String>) -> Self {
        let mut m = HashMap::new();
        for (i, word) in words.into_iter().enumerate() {
            let mut prefix = String::new();
            for pc in word.chars() {
                prefix.push(pc);
                let mut suffix = String::new();
                for sc in word.chars().rev() {
                    suffix.insert(0, sc);
                    *m.entry(suffix.clone() + "#" + &prefix).or_insert(0) = i as i32;
                }
            }
        }
        Self { m }
    }

    fn f(&self, prefix: String, suffix: String) -> i32 {
        *self.m.get(&(suffix + "#" + &prefix)).unwrap_or(&-1)
    }
}