该程序的目标是从单词列表中返回所有包含6个元音字母(包括
y
)且按字母顺序排列的单词。例如,答案可能类似于:Aerious(但Aerious不可行,因为它没有y
)。目前该程序未返回任何单词。我认为containsVowels
方法不正确。public static void question11() {
System.out.println("Question 11:");
System.out.println("All words that have 6 vowels once in alphabetical order: ");
String vowelWord = "";
for (int i = 1; i< WordList.numWords(); i++) {
if (containsVowels(WordList.word(i))) {
if (alphabetical(WordList.word(i))) {
vowelWord = WordList.word(i);
System.out.println(vowelWord);
}
}
}
return;
}
public static boolean alphabetical(String word) {
int vowelPlaceA = 0;
int vowelPlaceE = 0;
int vowelPlaceI = 0;
int vowelPlaceO = 0;
int vowelPlaceU = 0;
int vowelPlaceY = 0;
for (int i = 0; i < word.length(); i++) {
if (word.charAt(i) == 'a') {
vowelPlaceA = i;
}
if (word.charAt(i) == 'e') {
vowelPlaceE = i;
}
if (word.charAt(i) == 'i') {
vowelPlaceI = i;
}
if (word.charAt(i) == 'o') {
vowelPlaceO = i;
}
if (word.charAt(i) == 'u') {
vowelPlaceU = i;
}
if (word.charAt(i) == 'y') {
vowelPlaceY = i;
}
//check a alphabetical
if(vowelPlaceA > vowelPlaceE || vowelPlaceA > vowelPlaceI || vowelPlaceA > vowelPlaceO ||
vowelPlaceA > vowelPlaceU || vowelPlaceA > vowelPlaceY) {
return false;
}
//check e alphabetical
if(vowelPlaceE > vowelPlaceI || vowelPlaceE > vowelPlaceO ||
vowelPlaceE > vowelPlaceU || vowelPlaceE > vowelPlaceY) {
return false;
}
//i
if(vowelPlaceI > vowelPlaceO || vowelPlaceI > vowelPlaceU || vowelPlaceI > vowelPlaceY) {
return false;
}
//o
if(vowelPlaceO > vowelPlaceU || vowelPlaceO > vowelPlaceY) {
return false;
}
//u
if(vowelPlaceU > vowelPlaceY) {
return false;
}
}
return true;
}
public static boolean containsVowels(String word) {
String vowels = "aeiouy";
if (word.contains(vowels)) {
return true;
}
return false;
}
containsVowels
方法是错误的。你正在检查整个子字符串"aeiouy"。使用循环或正则表达式。 - keysercontains
只有在字符串包含该字符序列时才返回 true。 - Embattled Swag