Problema
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.
Restricciones
0 ≤ length of message ≤ 1000
The message uses printable ASCII characters, with no leading, trailing or double spaces
Ejemplos
Entrada:
message = "IDK if I can come BTW"
Salida esperada:
expected = "I don't know if I can come by the way"
Entrada:
std::string message = "IDK if I can come BTW";
Salida esperada:
std::string expected = "I don't know if I can come by the way";
Entrada:
string message = "IDK if I can come BTW";
Salida esperada:
string expected = "I don't know if I can come by the way";
Explicación
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".
Entrada:
message = "ok TTYL, jk"
Salida esperada:
expected = "ok TTYL, jk"
Entrada:
std::string message = "ok TTYL, jk";
Salida esperada:
std::string expected = "ok TTYL, jk";
Entrada:
string message = "ok TTYL, jk";
Salida esperada:
string expected = "ok TTYL, jk";
Explicación
TTYL, has a comma attached and jk is lowercase, so nothing changes: "ok TTYL, jk".
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Split on single spaces so you can look at one word at a time.
Pista 2
A dictionary from abbreviation to meaning keeps the code short.
Pista 3
Words that are not in the table go back unchanged; watch out for the empty message.
Complejidad esperada
O(n) time, O(n) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.