Условие
Grandpa keeps getting texts full of abbreviations, so you are writing a decoder for him. The decoder knows these eight abbreviations:
| Abbreviation | Meaning |
|---|---|
| BRB | be right back |
| BTW | by the way |
| IDK | I don't know |
| IMO | in my opinion |
| JK | just kidding |
| NVM | never mind |
| TMI | too much information |
| TTYL | talk to you later |
The message is split into words at single spaces. A word is replaced only when it is exactly one of the abbreviations, in capital letters and with nothing attached: BTW is replaced, but btw and BTW, are not.
Implement text_abbreviations(message).
Input
message: The text message. Words are separated by single spaces.
Output
Return the message with every abbreviation replaced by its meaning and everything else unchanged. An empty message gives an empty string.
Ограничения
0 ≤ length of message ≤ 1000
The message uses printable ASCII characters, with no leading, trailing or double spaces
Примеры
Ввод:
message = "IDK if I can come BTW"
Ожидаемый вывод:
expected = "I don't know if I can come by the way"
Ввод:
std::string message = "IDK if I can come BTW";
Ожидаемый вывод:
std::string expected = "I don't know if I can come by the way";
Ввод:
string message = "IDK if I can come BTW";
Ожидаемый вывод:
string expected = "I don't know if I can come by the way";
Пояснение
IDK and BTW are both whole words in the table, so the result is "I don't know if I can come by the way".
Ввод:
message = "ok TTYL, jk"
Ожидаемый вывод:
expected = "ok TTYL, jk"
Ввод:
std::string message = "ok TTYL, jk";
Ожидаемый вывод:
std::string expected = "ok TTYL, jk";
Ввод:
string message = "ok TTYL, jk";
Ожидаемый вывод:
string expected = "ok TTYL, jk";
Пояснение
TTYL, has a comma attached and jk is lowercase, so nothing changes: "ok TTYL, jk".
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Split on single spaces so you can look at one word at a time.
Подсказка 2
A dictionary from abbreviation to meaning keeps the code short.
Подсказка 3
Words that are not in the table go back unchanged; watch out for the empty message.
Ожидаемая сложность
O(n) time, O(n) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.