Suppose you have a string, S, made up of only 'a's and 'b's. Write a recursive function that checks if the string was generated using the following rules:

TITLE:-

Check AB

PROBLEM:-

Suppose you have a string, S, made up of only 'a's and 'b's. Write a recursive function that checks if the string was generated using the following rules:

a. The string begins with an 'a'
b. Each 'a' is followed by nothing or an 'a' or "bb"
c. Each "bb" is followed by nothing or an 'a'

If all the rules are followed by the given string, return true otherwise return false.

Input format :

String S

Output format :

'true' or 'false'

Constraints :

0 <= |S| <= 1000
where |S| represents length of string S.

Sample Input 1 :

abb

Sample Output 1 :

true

Sample Input 2 :

abababa

Sample Output 2 :

false

SOLUTION:-

#include <iostream>
using namespace std;

bool checkAB(char input[]) {
  if(input[0]=='a')
  {
      if(input[1]=='\0')
          return true;
      else if(input[1]=='a')
          return checkAB(input+1);
      else if(input[1]=='b'&&input[2]=='b')
      {
          if(input[3]=='\0')
              return true;
          else if(input[3]=='a')
              return checkAB(input+3);
          else
              return false;
      }
      else
          return false;
  }
    else
        return false;
}
     

int main() {
    char input[100];
    bool ans;
    cin >> input;
    ans=checkAB(input);
    if(ans)
        cout<< "true" << endl;
    else
        cout<< "false" << endl;
}

• Tweet
• Share
• Share
• Share
• Share

About Admin MC3

This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.

Related Post