Recursion-1 > noX
prev  |  next  |  chance

Given a string, compute recursively a new string where all the 'x' chars have been removed. noX("xaxb") → "ab" noX("abc") → "abc" noX("xx") → "" ...Save, Compile, Run public String noX(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 342.0

Copyright Nick Parlante 2006-09 - privacy