Recursion-1 > changeXY
prev  |  next  |  chance

Given a string, compute recursively (no loops) a new string where all the lowercase 'x' chars have been changed to 'y' chars. changeXY("codex") → "codey" changeXY("xxhixx") → "yyhiyy" changeXY("xhixhix") → "yhiyhiy" ...Save, Compile, Run public String changeXY(String str) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-1

Forget It! -- delete my code for this problem 336.0

Copyright Nick Parlante 2006-09 - privacy