-
Notifications
You must be signed in to change notification settings - Fork 0
/
Uddered_But_Not_Herd.java
48 lines (37 loc) · 1.71 KB
/
Uddered_But_Not_Herd.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
/*
ID: PG0611
LANG: JAVA
Task: Uddered But Not Herd
*/
import java.util.*;
import java.util.List;
public class Uddered_But_Not_Herd {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
ArrayList<String> letters = new ArrayList<String>();
ArrayList<Integer> indexes = new ArrayList<Integer>();
String cowphabet = input.nextLine(); //Take in the input for the cow alphabet
String lower_string = input.nextLine();//Take in input for the string Farmer John heard.
int iteration = 1; //Variable iteration to keep track of the number of times through the alphabet.
int lowerLength = lower_string.length();
for(int i =0; i<lowerLength; i++ ){ //Add the seperate of letters of the string into a ArrayList so it is easier to work with
char charForm = lower_string.charAt(i);
String stringForm = Character.toString(charForm);
letters.add(stringForm);
}
for (int z=0; z<letters.size(); z++){ //Get the indexes of each letter of the string in the cowphabet.
String check = letters.get(z);
int currentInstance = cowphabet.indexOf(check);
indexes.add(currentInstance);
}
for (int a = 0; a<indexes.size(); a++){ //If a is 0 do nothing because that is the first index.
if(a == 0){
}else{
if(indexes.get(a) <= indexes.get(a-1)) { // if a set index is less or equal to the previous index, increase the iteration by one.
iteration += 1;
}
}
}
System.out.println(iteration);
}
}