Palindrome

Question

I need a program fitting these rules:
-This program must be named Palindrome.
-Function adjust - This function will be passed the original string from main. This function will be passed the original string from main. This function will traverse the string in order and pull each character. If this character is a letter, it will add this letter to the new string. If it is not a letter, the character will be ignored and will move on to the next letter. The adjusted string will be passed back to main. (Basically removing all blank spaces and all punctuation marks from the original string.)
-Function reverse - This function will be passed the adjusted string from main. First, it makes sure that all the characters of the string are in lowercase. Second, it traverses the string and pulls each character in reverse order. It will add the letter to a new string. This string will be returned to main. (Remember that this reverses the string that does not have any spaces or punctuation marks.)
-Function match - This function will be passed the adjusted string and the reversed string. It will perform the task of checking to see if the strings are the same. The function will return either true or false to the main.
-Main - This will test our program and check both a palindrome string and a non-palindrome string. Be sure that you include enough variables for all items that are to be used and to hold all answers that are returned from other functions.
( This program will only have input in the code not in the cmd prompt, the sentence that should work is Madam, I'm Adam!, the one that should work is This should fail!, make sure it prints if it is a palindrome or not. Any help would be greatly appreciated please try to keep it lower level so i can understand it,)

Answer 1

As specified, this program will never work.
The spec for the reverse function says: "First, it makes sure that all the characters of the string are in lowercase". Which, quite apart from being bad design (nothing in the method name tells us the string is going to be down shifted) leaves a potentialy mixed case string being compared with a lower case one.
To fix this, downshift in the adjust method (not quite such bad design as the name is so vague that you can justifiably do whatever you like in it).
Enjoy!
public class Astrads1
     static String adjust(String source)
          String adjusted= "";
          for (int i= 0; i< source.length(); i++) {
               if (Character.isLetter(source.charAt(i)))
                    adjusted += source.charAt(i);
          return adjusted.toLowerCase();
     static String reverse(String source)
          String reversed= "";
          for (int i= source.length()-1; i >= 0; i--)
               reversed += source.charAt(i);
          return reversed;
     static boolean match(String adjusted, String reversed)
          for (int i= 0; i< adjusted.length(); i++) {
               if (adjusted.charAt(i) != reversed.charAt(i))
                    return false;
          return true;
     public static void main(String[] argv)
          String[] sources= new String[] {
               "Madam, I'm Adam!", "This should fail!" };
          for (int i= 0; i< sources.length; i++) {
               String source= sources;
               String adjusted= adjust(source);
               String reversed= reverse(adjusted);
               boolean matches= match(adjusted, reversed);
               System.err.println(
                    "Source= " source
                    "\nAdjusted= " adjusted
                    "\nReversed= " reversed
                    "\nMatches= " +matches);
               System.out.println(
                    "'" source "' is" +(matches ? "" : " not") +" a palindome");