Design a special dictionary with some words that searchs the words in it by a prefix and a suffix.
WordFilter(string words)Initializes the object with the
wordsin the dictionary.
f(string prefix, string suffix)Returns the index of the word in the dictionary, which has the prefix
prefixand 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
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".
1 <= words.length <= 15000
1 <= words[i].length <= 10
1 <= prefix.length, suffix.length <= 10
suffixconsist of lower-case English letters only.
15000calls will be made to the function