• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.21
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0701_0800.s0745_prefix_and_suffix_search.readme.md Maven / Gradle / Ivy

745\. Prefix and Suffix Search

Hard

Design a special dictionary that searches 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 pref, string suff)` Returns _the index of the word in the dictionary,_ which has the prefix `pref` and the suffix `suff`. 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 <= 104
*   `1 <= words[i].length <= 7`
*   `1 <= pref.length, suff.length <= 7`
*   `words[i]`, `pref` and `suff` consist of lowercase English letters only.
*   At most 104 calls will be made to the function `f`.