From e416be63bb7d684d4bb9d6e443addbf33c3d4b69 Mon Sep 17 00:00:00 2001 From: Oskar Enmalm Date: Fri, 29 Sep 2017 00:49:28 +0200 Subject: [PATCH 1/2] Create Abecedarian.java --- Misc/Abecedarian.java | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 Misc/Abecedarian.java diff --git a/Misc/Abecedarian.java b/Misc/Abecedarian.java new file mode 100644 index 000000000..8e4a17932 --- /dev/null +++ b/Misc/Abecedarian.java @@ -0,0 +1,21 @@ +//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 Date: Fri, 29 Sep 2017 01:04:24 +0200 Subject: [PATCH 2/2] Update Abecedarian.java Removed unnecessary println and compacted it --- Misc/Abecedarian.java | 8 ++------ 1 file changed, 2 insertions(+), 6 deletions(-) diff --git a/Misc/Abecedarian.java b/Misc/Abecedarian.java index 8e4a17932..6507411b4 100644 --- a/Misc/Abecedarian.java +++ b/Misc/Abecedarian.java @@ -10,12 +10,8 @@ class Abecedarian{ 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{ - System.out.println("That is not abecedarian"); - return false; + else{return false;} } - } - System.out.println("Wow, that number is abecedarian"); return true; - } +}