Условие
A word processor underlines words it does not know. Load the dictionary into a set (a hash table) so each lookup is fast, then scan the text.
A word is a maximal run of English letters (A-Z, a-z) and apostrophes; every other character (spaces, digits, punctuation) separates words. Words are compared without regard to case, so The matches the dictionary entry the.
Implement spell_checker(dictionary, text).
Input
dictionary: The known words. They may be in any case.
text: The text to check.
Output
Return the misspelled words in lowercase, in the order they first appear in the text, each listed only once. Return an empty list when every word is known.
Ограничения
0 ≤ dictionary size ≤ 2,000
0 ≤ length of text ≤ 10,000
Примеры
Ввод:
dictionary = ["the", "cat", "sat", "on", "mat"]
text = "The cat sat on teh mat, the cta!"
Ожидаемый вывод:
expected = ["teh", "cta"]
Ввод:
std::vector<std::string> dictionary = {"the", "cat", "sat", "on", "mat"};
std::string text = "The cat sat on teh mat, the cta!";
Ожидаемый вывод:
std::vector<std::string> expected = {"teh", "cta"};
Ввод:
string[] dictionary = new string[] {"the", "cat", "sat", "on", "mat"};
string text = "The cat sat on teh mat, the cta!";
Ожидаемый вывод:
string[] expected = new string[] {"teh", "cta"};
Пояснение
teh and cta are not in the dictionary. Case and the comma do not matter for the other words: ["teh", "cta"].
Ввод:
dictionary = ["Don't", "stop"]
text = "don't STOP, dont stop dont"
Ожидаемый вывод:
expected = ["dont"]
Ввод:
std::vector<std::string> dictionary = {"Don't", "stop"};
std::string text = "don't STOP, dont stop dont";
Ожидаемый вывод:
std::vector<std::string> expected = {"dont"};
Ввод:
string[] dictionary = new string[] {"Don't", "stop"};
string text = "don't STOP, dont stop dont";
Ожидаемый вывод:
string[] expected = new string[] {"dont"};
Пояснение
don't keeps its apostrophe and matches; dont is unknown and is listed once: ["dont"].
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Lowercase the dictionary words once when you build the set.
Подсказка 2
Build the current word character by character and finish it when you meet a non-letter that is not an apostrophe.
Подсказка 3
Keep a second set of words already reported.
Ожидаемая сложность
O(D + T) time, O(D + T) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.