모든 챌린지
쉬움 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

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위를 차지하세요.

다른 사람의 풀이 보기

커뮤니티 솔루션

아직 공개된 풀이가 없습니다. 문제를 풀고 첫 풀이를 공유하세요.