-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProblem18.java
74 lines (61 loc) · 1.48 KB
/
Problem18.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
package dimikOJ;
import java.util.ArrayList;
import java.util.Scanner;
public class Problem18 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner input = new Scanner(System.in);
int T = input.nextInt();
while (T < 1 || T > 100) {
T = input.nextInt();
}
String[] lines = new String[T];
for (int i = 0; i < T; i++) {
String temp = input.nextLine();
int length = temp.trim().length();
while (length < 1 || length > 100) {
temp = input.nextLine();
length = temp.trim().length();
}
lines[i] = temp.trim().replaceAll("\\s", "");
}
input.close();
for (int i = 0; i < lines.length; i++) {
ArrayList<Character> consonents = new ArrayList<Character>();
for (int j = 0; j < lines[i].length(); j++) {
if (isVowel(lines[i].charAt(j))) {
System.out.print(lines[i].charAt(j));
} else {
consonents.add(lines[i].charAt(j));
}
}
System.out.println();
for (Character character : consonents) {
System.out.print(character);
}
System.out.println();
}
}
public static boolean isVowel(char letter) {
char c = Character.toLowerCase(letter);
boolean isVowel = false;
switch (c) {
case 'a':
isVowel = true;
break;
case 'e':
isVowel = true;
break;
case 'i':
isVowel = true;
break;
case 'o':
isVowel = true;
break;
case 'u':
isVowel = true;
break;
}
return isVowel;
}
}