Recursion-1 > changePi
prev  |  next  |  chance

Given a string, compute recursively (no loops) a new string where all appearances of "pi" have been replaced by "3.14". changePi("xpix") → "x3.14x" changePi("pipi") → "3.143.14" changePi("pip") → "3.14p" ...Save, Compile, Run public String changePi(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 339.0

Copyright Nick Parlante 2006-09 - privacy