-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStubbornVowel.java
88 lines (80 loc) · 2.58 KB
/
StubbornVowel.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
package StringBasedProblems;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class StubbornVowel {
static String substring(char[] c, int i, int j) {
String s = "";
for (int k = i; k < j; k++)
s += c[k];
return s;
}
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
String s = "missingword";
char c[] = s.toCharArray();
ArrayList<String> list = new ArrayList<String>();
ArrayList<String> list2 = new ArrayList<String>();
ArrayList<Integer> list3 = new ArrayList<Integer>();
int i = 0;
while (i < c.length - 1) {
int j = i + 1;
if (c[i] != 'a' && c[i] != 'e' && c[i] != 'i' && c[i] != 'o' && c[i] != 'u') {
while (j < c.length && c[j] != 'a' && c[j] != 'e' && c[j] != 'i' && c[j] != 'o' && c[j] != 'u')
j++;
String sub = substring(c, i, j);
list.add(sub);
if (j < c.length) {
list2.add(String.valueOf(c[j]));
list3.add(j);
}
} else {
list2.add(String.valueOf(c[i]));
list3.add(i);
i++;
}
i = j + 1;
}
System.out.println(list);
System.out.println(list2);
System.out.println(list3);
// int k=0,l=list.size()-1;
String rk = "";
// while(k<list.size()){
// if(!(list.get(k).equals("a") && list.get(k).equals("e") &&
// list.get(k).equals("i") && list.get(k).equals("o") &&
// list.get(k).equals("u"))){
// if(!(list.get(l).equals("a") && list.get(l).equals("e") &&
// list.get(l).equals("i") && list.get(l).equals("o") &&
// list.get(l).equals("u"))){
// rk+=list.get(l);
// }
// l--;
// }
// else{
// rk+=list.get(k);
// }
// k++;
// }
// System.out.println(rk);
if (list3.get(1) == 0) {
int u = list.size() - 1, p = 0;
while (u >= 0) {
rk += list2.get(p) + list.get(u);
u--;
p++;
}
} else {
int u = list.size() - 1, p = 0;
while (u >= 0) {
rk += list.get(u);
if (p < list2.size())
rk += list2.get(p);
u--;
p++;
}
}
System.out.println(rk);
sc.close();
}
}