052 - Accumulator Method Challenge 2 (optional)

Write a method header on line two with the following specs:

 

Returns: a String Name: alphabetical Parameters: a String called str Purpose: Return a string that is composed of each letter as long as the letter is later on in the alphabet than its previous one. You can assume actual parameters are lowercase. See below examples.

 

Additional Info:

You can use < and > to compare characters (not Strings), where characters later on in the alphabet are "greater". Examples:

• 'a' < 'b' ==> True
• 'a' < 'a' ==> False
• 'a' > 'b' ==> False

 

Examples:

• alphabetical("abczef") ==> "abcz"
• alphabetical("adatplqzh") ==> "adtz"
• alphabetical("dbeuptvwmy") ==> "deuvwy"

---

Solution

 

class Main {
    public static String alphabetical(String s)
    {        
        s=s.toLowerCase();
        char max=s.charAt(0);
        String result=String.valueOf(s.charAt(0));
        for(int i=1;i<s.length();i++) {            
            if(max<s.charAt(i)){
                result+=String.valueOf(s.charAt(i));
                max=s.charAt(i);
            }
        }
        return (String)result;
    }
    
    //test case below (dont change):
    public static void main(String[] args){
        System.out.println(alphabetical("adatplqzh"));//"adtz"
        System.out.println(alphabetical("abczef"));// "abcz"
        System.out.println(alphabetical("dbeuptvwmy"));// "deuvwy"
    }
}