25 lines
523 B
Java
25 lines
523 B
Java
package Others;
|
|
|
|
/**
|
|
* An Abecadrian is a word where each letter is in alphabetical order
|
|
*
|
|
* @author Oskar Enmalm
|
|
*/
|
|
class Abecedarian {
|
|
|
|
public static boolean isAbecedarian(String s) {
|
|
int index = s.length() - 1;
|
|
|
|
for (int i = 0; i < index; i++) {
|
|
|
|
if (s.charAt(i) <= s.charAt(i + 1)) {
|
|
} //Need to check if each letter for the whole word is less than the one before it
|
|
|
|
else {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
}
|