Question: n 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.
n 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. You must write a recursive method. Examples cntStr("catcowcat", "cat") 2 cntStr ("catcowcat", "cow") 1 cntStr ("catcowcat", "dog")-0 String class methods: int size() char charAt( int index) String substring ( int beginindex, int endindex) String substring (int beginlndex) public int cntStr (String str, String sub) (
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
