mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
34 lines
1.5 KiB
HTML
34 lines
1.5 KiB
HTML
<p>Design a special dictionary that searches the words in it by a prefix and a suffix.</p>
|
|
|
|
<p>Implement the <code>WordFilter</code> class:</p>
|
|
|
|
<ul>
|
|
<li><code>WordFilter(string[] words)</code> Initializes the object with the <code>words</code> in the dictionary.</li>
|
|
<li><code>f(string pref, string suff)</code> Returns <em>the index of the word in the dictionary,</em> which has the prefix <code>pref</code> and the suffix <code>suff</code>. If there is more than one valid index, return <strong>the largest</strong> of them. If there is no such word in the dictionary, return <code>-1</code>.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input</strong>
|
|
["WordFilter", "f"]
|
|
[[["apple"]], ["a", "e"]]
|
|
<strong>Output</strong>
|
|
[null, 0]
|
|
<strong>Explanation</strong>
|
|
WordFilter wordFilter = new WordFilter(["apple"]);
|
|
wordFilter.f("a", "e"); // return 0, because the word at index 0 has prefix = "a" and suffix = "e".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= words.length <= 10<sup>4</sup></code></li>
|
|
<li><code>1 <= words[i].length <= 7</code></li>
|
|
<li><code>1 <= pref.length, suff.length <= 7</code></li>
|
|
<li><code>words[i]</code>, <code>pref</code> and <code>suff</code> consist of lowercase English letters only.</li>
|
|
<li>At most <code>10<sup>4</sup></code> calls will be made to the function <code>f</code>.</li>
|
|
</ul>
|