Problème
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.
Contraintes
0 ≤ length of message ≤ 1000
The message uses printable ASCII characters, with no leading, trailing or double spaces
Exemples
Entrée :
message = "IDK if I can come BTW"
Sortie attendue :
expected = "I don't know if I can come by the way"
Entrée :
std::string message = "IDK if I can come BTW";
Sortie attendue :
std::string expected = "I don't know if I can come by the way";
Entrée :
string message = "IDK if I can come BTW";
Sortie attendue :
string expected = "I don't know if I can come by the way";
Explication
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".
Entrée :
message = "ok TTYL, jk"
Sortie attendue :
expected = "ok TTYL, jk"
Entrée :
std::string message = "ok TTYL, jk";
Sortie attendue :
std::string expected = "ok TTYL, jk";
Entrée :
string message = "ok TTYL, jk";
Sortie attendue :
string expected = "ok TTYL, jk";
Explication
TTYL, has a comma attached and jk is lowercase, so nothing changes: "ok TTYL, jk".
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Split on single spaces so you can look at one word at a time.
Indice 2
A dictionary from abbreviation to meaning keeps the code short.
Indice 3
Words that are not in the table go back unchanged; watch out for the empty message.
Complexité attendue
O(n) time, O(n) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.