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

Given a string and a non-empty substring sub, compute recursively if at least n copies of sub appear in the string somewere, possibly with overlapping. N will be non-negative. strCopies("catcowcat", "cat", 2) → true strCopies("catcowcat", "cow", 2) → false strCopies("catcowcat", "cow", 1) → true ...Save, Compile, Run public boolean strCopies(String str, String sub, int n) { } 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 387.0

Copyright Nick Parlante 2006-10 - privacy