Question: 9. Write a recursive function string pairPlus (string n) i recursively compute a new string where identical chars that are adjacent in the original string
9. Write a recursive function string pairPlus (string n) i recursively compute a new string where identical chars that are adjacent in the original string are separated from each other by a"++" pairPlus ("hello")returns "hel++1o" pairPlus ("xxyy") 1 returns "xt+xytty" pairPlus ("aaaa'' ); // returns "atta+ta++
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
