問題
A school IT club suggests a quick way to turn a simple word into a stronger password. Swap these lowercase letters for look-alike symbols:
| Letter | Becomes |
|---|---|
| a | @ |
| e | 3 |
| i | ! |
| o | 0 (zero) |
| s | $ |
Every other character stays as it is (capital letters are not swapped). Then add # and the length of the original word at the end.
Implement password_modifier(word).
Input
word: The starting word.
Output
Return the new password.
制約
0 ≤ length of word ≤ 100
word uses printable ASCII characters
例
入力:
word = "mississippi"
期待される出力:
expected = "m!$$!$$!pp!#11"
入力:
std::string word = "mississippi";
期待される出力:
std::string expected = "m!$$!$$!pp!#11";
入力:
string word = "mississippi";
期待される出力:
string expected = "m!$$!$$!pp!#11";
解説
Every i becomes ! and every s becomes $, and the word has 11 letters: "m!$$!$$!pp!#11".
入力:
word = "Oreo"
期待される出力:
expected = "Or30#4"
入力:
std::string word = "Oreo";
期待される出力:
std::string expected = "Or30#4";
入力:
string word = "Oreo";
期待される出力:
string expected = "Or30#4";
解説
The capital O stays, e becomes 3 and the last o becomes 0; the length is 4: "Or30#4".
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Look at each character and decide what to write in its place.
ヒント 2
Only the five lowercase letters change; everything else is copied.
ヒント 3
Use the length of the original word, then convert it to text before adding it.
目安の計算量
O(n) time, O(n) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。