すべてのチャレンジ
簡単 0件解決済み 正答率0%

Text Message Abbreviations

Expand common texting abbreviations in a message into full words.

このチャレンジで学べること

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

問題

翻訳を表示

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.

制約

0 ≤ length of message ≤ 1000

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

例

例 1
入力:
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".

例 2
入力:
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 つずつ開いてみましょう。

ヒント 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用に調整されています。上記の説明と制約に従ってください。

ランキング

全体ランキング

コーダーごとのいちばん良い合格解答です。速く、メモリが少なく、評価が高い解答ほど上位になります。

まだ合格した解答はありません。解いて 1 位になりましょう。

他の人の解答から学ぶ

コミュニティの解答

まだ公開された解答がありません。この課題を解いて最初の解答を共有しましょう。