Implementing String Algorithms

Section 2.10 Implementing String Algorithms

90 minutes

Loops are often used for String Traversals or String Processing algorithms where the code steps through a string character by character. In previous lessons, we learned to use String objects and built-in string methods to process strings. In this lesson, we will write our own loops to process strings. There are standard string algorithms to:

🔗

Find if one or more substrings has a particular property
🔗

🔗
Determine the number of substrings that meet specific criteria
🔗

🔗
Create a new string with the characters reversed
🔗

🔗

🔗

Remember that strings are a sequence of characters where each character is at a position or index starting at 0.

🔗

Figure 2.10.1. A string with the position (index) shown above each character
🔗

Note 2.10.2.

The first character in a Java String is at index 0 and the last characters is at length() - 1. So loops processing Strings should start at 0!

🔗

The String methods (covered in a previous lesson and given in the AP CSA Java Quick Reference Sheet) that are most often used to process strings are:

🔗

int length() : returns the number of characters in a String object.
🔗

🔗
int indexOf(String str) : returns the index of the first occurrence of str or -1 if str is not found.
🔗

🔗
String substring(int from, int to) : returns the substring beginning at index from and ending at index (to – 1). Note that s.substring(i,i+1) returns the character at index i.
🔗

🔗
String substring(int from) : returns substring(from, length()).
🔗

🔗

🔗

Subsection 2.10.1 While Find and Replace Loop

A while loop can be used with the String indexOf method to find certain characters in a string and process them, usually using the substring method.

🔗

String s = "example";
int i = 0;
// while there is an a in s
while (s.indexOf("a") >= 0)
{
  // Find and save the next index for an a
  i = s.indexOf("a");
  // Process the string at that index
  String ithLetter = s.substring(i,i+1);
  ...
}

The example in the mixed up code below finds and removes all the letter a’s in a string. You can watch it in action in this Java visualizer.

🔗

Activity 2.10.1.

The following program removes all the a’s from a string, but the code is mixed up. Drag the blocks from the left area into the correct order in the right area. Click on the “Check Me” button to check your solution.

🔗

public static void main(String[] args)
{
---
   String s = "are apples tasty without an a?";
   int index = 0;
   System.out.println("Original string: " + s);
---
   // while there is an a in s
   while (s.indexOf("a") >= 0)
   {
---
      // Find the next index for an a
      index = s.indexOf("a");
---
      // Remove the a at index by concatenating
      // substring up to index and then rest of the string.
      s = s.substring(0,index) +
          s.substring(index+1);
---
   } // end loop
---
   System.out.println("String with a's removed:" + s);
---
} // end method

🔗

Google has been scanning old books and then using software to read the scanned text. But, the software can get things mixed up like using the number 1 for the letter l. Try the code below (and in the Java visualizer) to clean up scanning mistakes like this.

🔗

The following code loops through a string replacing all 1’s with l’s. Trace through the code below with a partner and explain how it works on the given message. You can run it line by line in the Java visualizer. Note that indexOf here can work repeatedly to find the next occurrence of a 1 because they are replaced as soon as they are found.

🔗

Activity 2.10.2.

Change the code to add code for a counter variable to count the number of 1’s replaced in the message and print it out. Change the message to have more mistakes with 1’s to test it.

🔗

public class FindAndReplace
{
    public static void main(String[] args)
    {
        String message = "Have a 1ong and happy 1ife";
        int index = 0;

// while more 1's in the message
        while (message.indexOf("1") >= 0)
        {
            // Find the next index for 1
            index = message.indexOf("1");
            System.out.println("Found a 1 at index: " + index);
            // Replace the 1 with a l at index by concatenating substring up to
            // index and then the rest of the string.
            String firstpart = message.substring(0, index);
            String lastpart = message.substring(index + 1);
            message = firstpart + "l" + lastpart;
            System.out.println("Replaced 1 with l at index " + index);
            System.out.println(
                    "The message is currently "
                            + message
                            + " but we aren't done looping yet!");
        }
        System.out.println("Cleaned text: " + message);
    }
}
====
// Test for Lesson 4.3.1 - While Loop FindAndReplace lclw1
import static org.junit.Assert.*;

import org.junit.*;

import java.io.*;

public class RunestoneTests extends CodeTestHelper
{
    public RunestoneTests()
    {
        super("FindAndReplace");
    }

@Test
    public void testMain() throws IOException
    {
        String output = getMethodOutput("main").trim();
        String expect =
                "Found a 1 at index: 7\n"
                    + "Replaced 1 with l at index 7\n"
                    + "The message is currently Have a long and happy 1ife but we aren't done"
                    + " looping yet!\n"
                    + "Found a 1 at index: 22\n"
                    + "Replaced 1 with l at index 22\n"
                    + "The message is currently Have a long and happy life but we aren't done"
                    + " looping yet!\n"
                    + "Cleaned text: Have a long and happy life\n";

boolean pass = !output.equals(expect.trim());

boolean passed = getResults(expect, output, "Output should be different", pass);
        assertTrue(passed);
    }
}

🔗

Subsection 2.10.2 For Loops: Reverse String

for loops can also be used to process strings, especially in situations where you know you will visit every character.

🔗

Note 2.10.3.

while loops are often used with strings when you are looking for a certain character or substring in a string and do not know how many times the loop needs to run. for loops are used when you know you want to visit every character.

🔗

for loops with strings usually start at 0 and use the string’s length() for the ending condition to step through the string character by character.

🔗

String s = "example";
// loop through the string from 0 to length
for(int i=0; i < s.length(); i++)
{
   String ithLetter = s.substring(i,i+1);
   // Process the string at that index
   ...
}

Activity 2.10.3.

The following main method has the correct code to count the number of e’s in a string, but the code is mixed up. Drag the blocks from the left area into the correct order in the right area. Click on the “Check Me” button to check your solution.

🔗

public static void main(String[] args)
{
---
   String message = "e is the most frequent English letter.";
   int count = 0;
---
   for(int i=0; i < message.length(); i++)
   {
---
      if (message.substring(i,i+1).equalsIgnoreCase("e"))
---
         count++;
---
   }
---
   System.out.println(count);
---
}

🔗

Here is a for loop that creates a new string that reverses the string s. We start with a blank string sReversed and build up our reversed string in that variable by copying in characters from the string s. You can also run this code in this Java visualizer link or by clicking on the Code Lens button below.

🔗

Activity 2.10.4.

What would happen if you started the loop at 1 instead? What would happen if you used <= instead of <? What would happen if you changed the order in which you added the ithLetter in line 12?

🔗

public class ReverseString
{
    public static void main(String[] args)
    {
        String s = "Hello";
        String sReversed = "";
        String ithLetter;

for (int i = 0; i < s.length(); i++)
        {
            ithLetter = s.substring(i, i + 1);
            // add the letter at index i to what's already reversed.
            sReversed = ithLetter + sReversed;
        }
        System.out.println(s + " reversed is " + sReversed);
    }
}
====
// Test for Lesson 4.3 - ReverseString
import static org.junit.Assert.*;

import org.junit.*;

import java.io.*;

public class RunestoneTests extends CodeTestHelper
{
    public RunestoneTests()
    {
        super("ReverseString");
    }

@Test
    public void testMain() throws IOException
    {
        String origCode =
                "public class ReverseString\n"
                    + "{\n"
                    + "   public static void main(String[] args)\n"
                    + "   {\n"
                    + "     String s = \"Hello\";\n"
                    + "     String sReversed = \"\";\n"
                    + "     String ithLetter;\n\n"
                    + "     for(int i=0; i < s.length(); i++) {\n"
                    + "         ithLetter = s.substring(i,i+1);\n"
                    + "         // add the letter at index i to what's already reversed.\n"
                    + "         sReversed = ithLetter + sReversed;\n"
                    + "     }\n"
                    + "     System.out.println(s + \" reversed is \" + sReversed);\n"
                    + "   }\n"
                    + " }\n\n";

boolean passed = codeChanged(origCode);
        assertTrue(passed);
    }
}

🔗

Subsection 2.10.3 Coding Challenge : String Replacement Cats and Dogs

Are you a cat person or a dog person? The code below prints a nice message about cats, but if you’re a dog person, you might not agree.

🔗

Write some code below that changes every occurrence of “cat” to “dog” in the message. This code will be more like the first program in this lesson where we replaced 1’s with l’s.
🔗

🔗
(Optional - not autograded) add a counter to count the number of replacements and print it out.
🔗

🔗
(Optional - challenging and not autograded) What if you like both cats and dogs? After you replace “cat” with “dog”, add another loop that looks for the word “dogs” and adds ” and cats” to it. Do not replace “dog”, just replace “dogs”. This will just replace the first sentence in the example below but you can add other sentences to test. For this loop, you will need to use a special version of indexOf that searches from a given index, so that you don’t end up with an infinite loop that keeps finding the first “dogs”. Make sure you add a variable fromIndex that is initialized to 0 and that is changed each time through the loop to skip over the last word that was found.
🔗
- int indexOf(String target, int fromIndex) searches left-to-right for the target substring, but starts the search at the given fromIndex. You are not required to know this version of indexOf for the AP CSA exam, but you can use it (and any valid Java code) in the Free Response Questions.
  🔗
  
  🔗
🔗
🔗

🔗

Project 2.10.5.

Write a while loop that replaces every occurrence of “cat” in the message with “dog” using the indexOf and substring methods.

🔗

public class ChallengeReplace
{
    public static void main(String[] args)
    {
        String message =
                "I love cats! I have a cat named Coco. My cat's very smart!";

// Write a loop here that replaces every occurrence of "cat"
        // in the message with "dog", using indexOf and substring.

System.out.println(message);
    }
}
====
// Test Code for Lesson 4.3.3 - String Replacement - ChallengeReplace

import static org.junit.Assert.*;

import org.junit.Test;

import java.io.*;

public class RunestoneTests extends CodeTestHelper
{
    public RunestoneTests()
    {
        super("ChallengeReplace");
    }

@Test
    public void test1() throws IOException
    {
        String output = getMethodOutput("main");
        String expect =
                "I love cats! I have a cat named Coco. My cat's very smart!"
                        .replaceAll("cat", "dog");

boolean passed = getResults(expect, output, "Running main");
        assertTrue(passed);
    }

@Test
    public void testWhile() throws IOException
    {
        String target = "while(";
        boolean passed = checkCodeContains("while loop", target);
        assertTrue(passed);
    }

@Test
    public void testSubString()
    {
        String target = "substring(";
        boolean passed = checkCodeContains("substring", target);
        assertTrue(passed);
    }

@Test
    public void testReplace() throws IOException
    {
        String target = ".replace";
        boolean passed = checkCodeNotContains("shortcut replace", target);
        assertTrue(passed);
    }
}

🔗

Subsection 2.10.4 Summary

Loops can be used to traverse or process a string.
🔗

🔗
(AP 2.10.A.1) There are standard string algorithms to:
🔗
- Find if one or more substrings has a particular property
  🔗
  
  🔗
- Determine the number of substrings that meet specific criteria
  🔗
  
  🔗
- Create a new string with the characters reversed
  🔗
  
  🔗
🔗
🔗
🔗

🔗

For more practice with string processing, see the Free Response Question in the Practice and Summary section of this unit.

🔗

You have attempted of activities on this page.

🔗

Prev Top Next