Write a method named LeetSpeak that accepts two string parameters representing an input and output file respectively.
Your method should convert the input file's text to "leet speak" (aka 1337 speak), an internet dialect where various letters are replaced by other letters/numbers,
and output the "leet" version of the text to the given output file.
Preserve the original line breaks from the input.
Also wrap each word of input in parentheses.
Perform the following replacements:
| Original character |
'Leet' character |
o |
0 |
l (lowercase L) |
1 |
e |
3 |
a |
4 |
t |
7 |
s (at the end of a word only) |
Z |
For example, if the input file lincoln.txt contains the following text:
four score and
seven years ago our
fathers brought forth on this continent
a new nation
Then after a call of LeetSpeak("lincoln.txt", "leet.txt");, the output file leet.txt should contain the following text:
(f0ur) (sc0r3) (4nd)
(s3v3n) (y34rZ) (4g0) (0ur)
(f47h3rZ) (br0ugh7) (f0r7h) (0n) (7hiZ) (c0n7in3n7)
(4) (n3w) (n47i0n)
You may assume that each token from the input file is separated by exactly one space.
