A recursive function is defined to take a string as a parameter and return the number of characters that are not exclamation points. It recursively calls itself, passing a substring of the original starting from the next character each time, until the base case of a string with one character is reached. It returns 1 if the character is not an exclamation point, or 0 if it is, accumulating the counts back up the recursive calls to get the total length without exclamation points.

1. Write a recursive function that takes a string and returns the number of characters in it that are
NOT an exclamation point. The result for the following string should be 7: "abc!def!g!!" Recall
that you can do the following to get the substring of a string str starting at character x:
str.substr(x) If you write a function that does not meaningfully use recursion, you can only
receive up to two-thirds credit. int lengthMinusExclamationPoints(const strings original) {
Solution
int lengthMinusExclamationPoints(const string& original){
char ch = original.charAt(0);
if(original.length()>1){
if(ch!='!')
return 1+lengthMinusExclamationPoints(original.substr(1));
else
return lengthMinusExclamationPoints(original.substr(1));
}
else{
if(ch!='!')
return 1;
else
return 0;
}
}