Recursion-1 > strDist
prev  |  next  |  chance

Given a string and a non-empty substring sub, compute recursively the largest substring which starts and ends with sub and return its length. strDist("catcowcat", "cat") → 9 strDist("catcowcat", "cow") → 3 strDist("cccatcowcatxx", "cat") → 9 ...Save, Compile, Run public int strDist(String str, String sub) { } 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 390.0

Copyright Nick Parlante 2006-09 - privacy