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

Given a string and a non-empty substring sub, compute recursively the number of times that sub appears in the string, without the sub strings overlapping. strCount("catcowcat", "cat") → 2 strCount("catcowcat", "cow") → 1 strCount("catcowcat", "dog") → 0 ...Save, Compile, Run public int strCount(String str, String sub) { } 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 384.0

Copyright Nick Parlante 2006-10 - privacy