문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.