문제
In a word game, one player writes a story with blanks and the others call out words without seeing the story. A blank is written as a hint in square brackets, such as [noun] or [number]. Replace the first blank with the first word, the second blank with the second word, and so on, brackets and hint included. If there are fewer words than blanks, the blanks left over stay exactly as they are; extra words are not used.
Implement mad_lib_builder(template, words).
Input
template: The story. Every [ is closed by a later ], with no brackets nested inside a blank.
words: The words to put in the blanks, in order.
Output
Return the finished story.
제약 조건
0 ≤ length of template ≤ 1000
0 ≤ length of words ≤ 100, each word has at most 30 characters and no square brackets
예시
입력:
template = "My [animal] ate [number] [food] for breakfast."
words = ["hamster", "12", "pancakes"]
예상 출력:
expected = "My hamster ate 12 pancakes for breakfast."
입력:
std::string template = "My [animal] ate [number] [food] for breakfast.";
std::vector<std::string> words = {"hamster", "12", "pancakes"};
예상 출력:
std::string expected = "My hamster ate 12 pancakes for breakfast.";
입력:
string template = "My [animal] ate [number] [food] for breakfast.";
string[] words = new string[] {"hamster", "12", "pancakes"};
예상 출력:
string expected = "My hamster ate 12 pancakes for breakfast.";
설명
Each blank takes the next word: "My hamster ate 12 pancakes for breakfast.".
입력:
template = "The [adjective] [noun] sang."
words = ["sleepy"]
예상 출력:
expected = "The sleepy [noun] sang."
입력:
std::string template = "The [adjective] [noun] sang.";
std::vector<std::string> words = {"sleepy"};
예상 출력:
std::string expected = "The sleepy [noun] sang.";
입력:
string template = "The [adjective] [noun] sang.";
string[] words = new string[] {"sleepy"};
예상 출력:
string expected = "The sleepy [noun] sang.";
설명
Only one word was given, so the second blank stays: "The sleepy [noun] sang.".
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Scan the template character by character and copy normal characters straight to the result.
힌트 2
When you see `[`, find the matching `]` and treat everything in between as one blank.
힌트 3
Keep a counter of blanks seen; if it reaches the number of words, copy the blank unchanged.
예상 복잡도
O(n + total word length) time, O(n) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.