Question: 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.
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. You must write a recursive method String class methods: Examples cntStr("catcowcat", "cat")-> 2 cntStr ("catcow cat", "cow") 1 cntStr ( "catcowcat", "dog")-> 0 int size() char charAt( int index) String substring ( int beginindex, int endindex String substring (int beginindex) 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
