Recursion-1 > countX
prev  |  next  |  chance

Given a string, compute recursively (no loops) the number of lowercase 'x' chars in the string. countX("xxhixx") → 4 countX("xhixhix") → 3 countX("hi") → 0 ...Save, Compile, Run public int countX(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 330.0

Copyright Nick Parlante 2006-09 - privacy