Complete this code:Do not use any loops within your code.Do not use any regular expressions and methods such as matches, split, replaceAll./** * Count the number of occurrences of substrings "baba" or "mama" * in the input string recursively. They may overlap. * For example, countBabaMama("aba babaa amama ma") → 2, * and countBabaMama("bababamamama") → 4. * @param input is the input string. * @return the number of occurrences. */public static int countBabaMama(String input) { // base case // recursive step} Given a string, write a method that returns the number of occurrences ofsubstrings "baba" or "mama" in the input string recursively.They may overlap.Do not use any loops within your code.Do not use any regular expressions and methods such as matches, split,replaceAll.Test case 1:countBabaMama ("aba babaa amama ma")2Test case 2:countBabaMama ("bababamamama")4For example:TestResultString input = "aba babaa amama ma";2System.out.print(countBabaMama (input));String input"bababamamama";4System.out.print(countBabaMama (input));

Algorithm: Start the program. Read the string and substring to find. Using split function find the…

Answered: Count the number of occurrences of…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Complete this code:
Do not use any loops within your code.
Do not use any regular expressions and methods such as matches, split, replaceAll.

/**
* Count the number of occurrences of substrings "baba" or "mama"
* in the input string recursively. They may overlap.
* For example, countBabaMama("aba babaa amama ma") → 2,
* and countBabaMama("bababamamama") → 4.
* @param input is the input string.
* @return the number of occurrences.
*/
public static int countBabaMama(String input) {
// base case

// recursive step

}

Given a string, write a method that returns the number of occurrences of
substrings "baba" or "mama" in the input string recursively.
They may overlap.
Do not use any loops within your code.
Do not use any regular expressions and methods such as matches, split,
replaceAll.
Test case 1:
countBabaMama ("aba babaa amama ma")
2
Test case 2:
countBabaMama ("bababamamama")
4
For example:
Test
Result
String input = "aba babaa amama ma";
2
System.out.print(countBabaMama (input));
String input
"bababamamama";
4
System.out.print(countBabaMama (input));

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions