mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-19 17:54:42 +08:00
docs: update the whole repository
* fix some bugs * delete duplicate files * format code
This commit is contained in:
@ -1,17 +1,24 @@
|
||||
//Oskar Enmalm 29/9/17
|
||||
//An Abecadrian is a word where each letter is in alphabetical order
|
||||
|
||||
class Abecedarian{
|
||||
package Others;
|
||||
|
||||
public static boolean isAbecedarian(String s){
|
||||
/**
|
||||
* 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++){
|
||||
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
|
||||
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;}
|
||||
else {
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user