CodingBat/Java/Recursion-1/StrCount.java at master · pauldpearson/CodingBat · GitHub

10 lines (8 loc) · 295 Bytes

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
public class StrCount {