-
Notifications
You must be signed in to change notification settings - Fork 0
/
CroatiaAlphabet.java
59 lines (49 loc) · 1.18 KB
/
CroatiaAlphabet.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
package string;
import java.util.Scanner;
public class CroatiaAlphabet {
public static void theBetterSolution(){
Scanner scan = new Scanner(System.in);
String target[] = {"c=", "c-", "dz=", "d-", "lj", "nj", "s=", "z="};
String str = scan.nextLine();
for (int i = 0; i < target.length; i++)
str = str.replace(target[i], "a");
System.out.println(str.length());
scan.close();
}
public static void solution(){
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char before2 = ' ';
char before1 = ' ';
int cnt = 0;
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if(ch == '='){
if(before1 == 'c' || before1 == 's')
cnt--;
if(before1 == 'z'){
cnt--;
if(before2 == 'd')
cnt--;
}
}
if(ch == '-'){
if(before1 == 'c' || before1 == 'd')
cnt--;
}
if(ch == 'j'){
if(before1 == 'l' || before1 == 'n')
cnt--;
}
cnt++;
before2 = before1;
before1 = ch;
}
System.out.println(cnt);
scan.close();
}
public static void main(String[] args) {
theBetterSolution();
// solution();
}
}