Question

This is in C++.

(10 points) Write a de-duplication function that iteratively sanitizes (removes) all consecutive duplicates in a C++ string. Consecutive duplicates are a pair of duplicate English alphabets sitting next to each other in the input string. Example: "AA", "KK", etc., are all consecutive duplicates. This function will internally run as many iterations as needed to remove all consecutive duplicates until there is either no consecutive duplicates left, or the string becomes empty (in which the function returns a NULL string back to the user): string deduplicate(string input) Note a NULL string is strings - NULL not string s - "NULL" which is a string with "NULL" as its value. Your main may look like the following, or anything you prefer to put in it as it is not graded: int main() { cout << deduplicate("AABE"); // should return a NULL string cout << deduplicate("A"); // "A" cout << deduplicate("ABBA"); // should return a NULL string cout << deduplicate("AAA"); // "A" cout << deduplicate("AKA"); // "AKA" because there is no consecutive pair. return; } . EXAMPLES "KCCK" -> first iteration results in "KK" by removing "CC" as consecutive duplicates -> second iteration starts with "KK" as consecutive duplicates hence removed. Function returns a MULL string. "ZZZ -> first iteration results in "Z" by removing the first "ZZ". There is nothing to be removed after that. Function returns "Z". • "KKCCD" -> first iteration removes "KK" resulting in "CCD" -> second iteration removes "CC"resulting in "D". There is nothing left to be removed. Function return "D". STARTER CODE #include < #include < using namespace std; // YOUR API DOCUMENTATION HERE: FAILURE TO // INCLUDE API WILL BE DOCKED A POINT string deduplicate(string str) // YOUR COOE HERE } int main() cout << deduplicate("A"); // "A" return; CONSTRAINTS/ASSUMPTIONS • Input string consists of only uppercase English alphabets, "A" - "Z". • Input string consists of at least 1 English alphabet. • Input string consists of at most 100 alphabets. Function returns the non-reducible string. • If the reduced string is empty, function returns the string "Empty":

Answer 1

#include<iostream>
#include<string>

using namespace std;

string reduplicate(string input)
{
    string s;
    int len = input.length();
    if(len == 1)
    {
        string c(1, input.at(0));
        s.append(c);
    }
    else
    {
        for(int i = 0; i < len; i++)
         {
             s = "";
              for (int j = 0; j < len-1; j++)
                {
                        char ch = input.at(j);
                        if(ch != input.at(j+1)){
                           string c(1, input.at(j));
                           s.append(c);
                        }
                        else {
                          j++;
                        }

                        if(j == len-2) {
                            string c(1, input.at(j+1));
                           s.append(c);
                        }

                }
            input = s;
            len = input.length();

         }
    }


    return s;
}

int main()
{

 cout << reduplicate("AABB") << endl; // NULL
 cout << reduplicate("A") << endl; // A
 cout << reduplicate("ABBA") << endl;// NULL
 cout << reduplicate("AAA") << endl; // A
 cout << reduplicate("AKA") << endl; // AKA


 return 0;
}