String Stuff

Computers are good at doing boring repetitive work!

Since computers are really fast and really good at doing simple calculations, we are going to let it do that.

Here is the problem

Pick one (1) of the following "functions" and write the code to actually perform it

• String blowup(String str)

Returns a version of the original string as follows: each digit 0-9 that appears in the original string is replaced by that many occurrences of the character to the right of the digit. So the string "a3tx2z" yields "attttxzzz", and "12x" yields "2xxx". A digit not followed by a character (i.e. at the end of the string) is replaced by nothing.

• int maxRun(String str)

Given a string, returns the length of the largest run in the string. A "run" is a series of zero or more adjacent characters that are the same. So the max run of "xxyyyz" is 3, and the max run of "xyz" is 1.

• Some other string manipulation that you would like to do, that is approved by me in advanced.

Things to note

• If you are not sure on any part of the problem, just ask me and I will give you additional information
• You must do the program in Java first (get a 3+). You can get a 4+ by doing the program in another programming language approved by me in advanced
• See Marking Rubric below
• Ensure you work through (in order):
  • Top-down
  • Flow-chart
  • Pseudo-code
  • Test cases
  • Final, debugged, commented code
  • Screen shot proving test cases are correct
  • Link to the Github repo and screen shot of the homepage (showing the Readme)
• Remember to think, Input – Process – Output, when designing your program
• Ensure you follow the "Hand in Process"