Tutte le sfide
Facile 0 risolte 0% di accettazione

Text Message Abbreviations

Expand common texting abbreviations in a message into full words.

Cosa imparerai

  • Split a sentence into words and join it back
  • Store abbreviations in a dictionary or map
  • Replace only exact whole-word matches

Problema

Mostra traduzione

Grandpa keeps getting texts full of abbreviations, so you are writing a decoder for him. The decoder knows these eight abbreviations:

AbbreviationMeaning
BRBbe right back
BTWby the way
IDKI don't know
IMOin my opinion
JKjust kidding
NVMnever mind
TMItoo much information
TTYLtalk 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.

Vincoli

0 ≤ length of message ≤ 1000

The message uses printable ASCII characters, with no leading, trailing or double spaces

Esempi

Esempio 1
Input:
message = "IDK if I can come BTW"

Output atteso:
expected = "I don't know if I can come by the way"
Input:
std::string message = "IDK if I can come BTW";

Output atteso:
std::string expected = "I don't know if I can come by the way";
Input:
string message = "IDK if I can come BTW";

Output atteso:
string expected = "I don't know if I can come by the way";

Spiegazione

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".

Esempio 2
Input:
message = "ok TTYL, jk"

Output atteso:
expected = "ok TTYL, jk"
Input:
std::string message = "ok TTYL, jk";

Output atteso:
std::string expected = "ok TTYL, jk";
Input:
string message = "ok TTYL, jk";

Output atteso:
string expected = "ok TTYL, jk";

Spiegazione

TTYL, has a comma attached and jk is lowercase, so nothing changes: "ok TTYL, jk".

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Split on single spaces so you can look at one word at a time.

Suggerimento 2

A dictionary from abbreviation to meaning keeps the code short.

Suggerimento 3

Words that are not in the table go back unchanged; watch out for the empty message.

Complessità attesa

O(n) time, O(n) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.