Java > Recursion-1 > endX
prev  |  next  |  chance

Given a string, compute recursively a new string where all the lowercase 'x' chars have been moved to the end of the string. endX("xxre") → "rexx" endX("xxhixx") → "hixxxx" endX("xhixhix") → "hihixxx" ...Save, Compile, Run public String endX(String str) { } See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  CodingBat  >  Recursion-1

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

Copyright Nick Parlante 2006-10 - privacy