Recursion-1 > countPairs
prev  |  next  |  chance

We'll say that a "pair" in a string is two instances of a char separated by a char. So "AxA" the A's make a pair. Pair's can overlap, so "AxAxA" contains 3 pairs -- 2 for A and 1 for x. Recursively compute the number of pairs in the given string. countPairs("axa") → 1 countPairs("axax") → 2 countPairs("axbx") → 1 ...Save, Compile, Run public int countPairs(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 363.0

Copyright Nick Parlante 2006-09 - privacy