問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。