Forward Order StringBuffer

Classic programmed-learning exercises, refreshed for modern Java and presented in the current MrStyner.com portfolio style.

Modern Java noteThis archive has been refreshed for Java 25 LTS. Core language concepts remain useful, while outdated setup instructions and browser-era Java are labeled or replaced. Java 26 is the current feature release; Java 25 is used here as the stable teaching baseline.
go to previous page   go to home page   go to next page

Answer:

The answer follows.

Forward Order StringBuffer

class Tester
{
  public boolean test( String trial )
  {
    String lower = trial.toLowerCase();

    StringBuffer azBuffer  = new StringBuffer();

    for ( int j=0; j < lower.length(); j++ )
    {
       char c = lower.charAt(j);
       if ( c >= 'a' && c <= 'z' )
         azBuffer.append( c );
    }

    String forward  = azBuffer.;
    String backward = azBuffer. .  ;
    . . . .
  }
}

public class PalindromeTester
{
  . . . . .
}

After the for loop, azBuffer contains the alphabetic characters in their original order, bu converted to lower case. Now do this:

  1. Construct forward based on azBuffer.
  2. Reverse azBuffer.
  3. Construct backward based on the reversed azBuffer.

This can be done in two statements, using methods of StringBuffer.

QUESTION 11:

Fill in the blanks.