mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-06 17:29:31 +08:00
17
Misc/Abecedarian.java
Normal file
17
Misc/Abecedarian.java
Normal file
@ -0,0 +1,17 @@
|
||||
//Oskar Enmalm 29/9/17
|
||||
//An Abecadrian is a word where each letter is in alphabetical order
|
||||
|
||||
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;
|
||||
}
|
Reference in New Issue
Block a user