Условие
For a word game, players enter a list of words and a letter, and the game shows only the words that use that letter. Upper and lower case count as the same letter, so K matches kite and k matches Kansas.
Implement contains_character(words, letter).
Input
words: The list of words.
letter: A single English letter.
Output
Return the words that contain the letter, in their original order and spelling. Repeated words are kept as many times as they appear. If no word matches, return an empty list.
Ограничения
0 ≤ length of words ≤ 1000
Each word has 1 to 30 ASCII letters
letter is one ASCII letter
Примеры
Ввод:
words = ["apple", "Berry", "kiwi", "Grape"]
letter = "r"
Ожидаемый вывод:
expected = ["Berry", "Grape"]
Ввод:
std::vector<std::string> words = {"apple", "Berry", "kiwi", "Grape"};
std::string letter = "r";
Ожидаемый вывод:
std::vector<std::string> expected = {"Berry", "Grape"};
Ввод:
string[] words = new string[] {"apple", "Berry", "kiwi", "Grape"};
string letter = "r";
Ожидаемый вывод:
string[] expected = new string[] {"Berry", "Grape"};
Пояснение
Berry and Grape contain an r; apple and kiwi do not.
Ввод:
words = ["Ohio", "Utah", "Iowa"]
letter = "O"
Ожидаемый вывод:
expected = ["Ohio", "Iowa"]
Ввод:
std::vector<std::string> words = {"Ohio", "Utah", "Iowa"};
std::string letter = "O";
Ожидаемый вывод:
std::vector<std::string> expected = {"Ohio", "Iowa"};
Ввод:
string[] words = new string[] {"Ohio", "Utah", "Iowa"};
string letter = "O";
Ожидаемый вывод:
string[] expected = new string[] {"Ohio", "Iowa"};
Пояснение
Case is ignored, so Ohio and Iowa both match.
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Convert both the word and the letter to the same case before comparing.
Подсказка 2
Return the original word, not the converted copy.
Подсказка 3
Do not remove duplicates; just test each word on its own.
Ожидаемая сложность
O(total letters) time, O(n) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.