-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathanewalphabet.java
88 lines (51 loc) · 961 Bytes
/
anewalphabet.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
import java.util.Scanner;
public class anewalphabet {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
str = str.toLowerCase();
String word = "abcdefghijklmnopqrstuvwxyz";
String[] newAbc = {"@","8","(","|)","3","#","6","[-]","|","_|","|<","1","[]\\/[]","[]\\[]","0","|D","(,)","|Z","$","']['","|_|","\\/","\\/\\/","}{","`/","2"};
String answer = "";
for(int i=0; i < str.length(); i++){
if(word.contains(str.substring(i, i+1)))
{
answer += newAbc[((int)str.charAt(i))-97];
}
else
{
answer += str.substring(i, i+1);
}
}
System.out.println(answer);
scan.close();
/*
@
8
(
|)
3
#
6
[-]
|
_|
|<
1
[]\/[]
[]\[]
0
|D
(,)
|Z
$
']['
|_|
\/
\/\/
}{
`/
2
*/
}
}