


Recursive program to insert an asterisk between a pair of identical characters in C++
Given a string str1 as input. The goal is to insert a "*" between a pair of identical characters in the input string and return the resulting string using a recursive method.
If the input string is str1 = "wellness", then the output will be "wel*lnes*s"
Example
Input - str1 = "happiness"
Output - The string after adding *: hap*pines*s
Explanation - Adding * between pp and ss will get the resulting string hap*pines*s
##Input - str1 = ”swimmmmingggg pooool”
Output - The string after adding *: swim*m*m*ming*g*g*g po*o*o*ol
Explanation - Adding * between mm, gg and oo will result in the string swim*m*m*ming*g*g*g po*o*o*ol
The method used in the following program is as followsIn this method, take the string str1. In each iteration, str1 is divided into two parts with the current index as the midpoint. If the last character of the first substring is the same as the first character of the next substring, then the original string is set to substring 1 followed by "*", followed by substring 2. If the length of substring 2 is 0, the recursion ends.- Take the input string as str1 and calculate its length as len.
- The function addStar(string& s1, int i, int len1) accepts s1, its length and the current index as input, and adds * when the two pairs of characters are the same.
- Take tmp1 as a substring from index 0 to i.
- Take tmp2 as a substring from index i to len1 1.
- If the last character of tmp1 is equal to the first character of tmp2, set s1=tmp1 ’*’ tmp2.
- Call addStar(s1, i 1, len1) for the next iteration.
- Finally print str1 in the main function.
#include <iostream>
using namespace std;
void addStar(string& s1, int i, int len1){
string tmp1=s1.substr(0,i);
string tmp2=s1.substr(i,len1+1);
if (tmp2.length() == 0){
return;
}
if (tmp1[i-1] == tmp2[0]){
s1 = tmp1 + '*' + tmp2;
}
addStar(s1, i+1, len1);
}
int main(){
string str1 = "aabbcccdddd";
int len=str1.length();
addStar(str1, 0, len-1);
cout << "String after adding * : "<<str1 << endl;
return 0;
}
Copy after login
OutputIf we run the above code it will generate the following output#include <iostream> using namespace std; void addStar(string& s1, int i, int len1){ string tmp1=s1.substr(0,i); string tmp2=s1.substr(i,len1+1); if (tmp2.length() == 0){ return; } if (tmp1[i-1] == tmp2[0]){ s1 = tmp1 + '*' + tmp2; } addStar(s1, i+1, len1); } int main(){ string str1 = "aabbcccdddd"; int len=str1.length(); addStar(str1, 0, len-1); cout << "String after adding * : "<<str1 << endl; return 0; }
String after adding * : a*ab*bc*c*cd*d*d*d
The above is the detailed content of Recursive program to insert an asterisk between a pair of identical characters in C++. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



This article explains the C Standard Template Library (STL), focusing on its core components: containers, iterators, algorithms, and functors. It details how these interact to enable generic programming, improving code efficiency and readability t

This article details efficient STL algorithm usage in C . It emphasizes data structure choice (vectors vs. lists), algorithm complexity analysis (e.g., std::sort vs. std::partial_sort), iterator usage, and parallel execution. Common pitfalls like

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

Article discusses effective use of rvalue references in C for move semantics, perfect forwarding, and resource management, highlighting best practices and performance improvements.(159 characters)

This article details effective exception handling in C , covering try, catch, and throw mechanics. It emphasizes best practices like RAII, avoiding unnecessary catch blocks, and logging exceptions for robust code. The article also addresses perf

C 20 ranges enhance data manipulation with expressiveness, composability, and efficiency. They simplify complex transformations and integrate into existing codebases for better performance and maintainability.

The article discusses using move semantics in C to enhance performance by avoiding unnecessary copying. It covers implementing move constructors and assignment operators, using std::move, and identifies key scenarios and pitfalls for effective appl

The article discusses dynamic dispatch in C , its performance costs, and optimization strategies. It highlights scenarios where dynamic dispatch impacts performance and compares it with static dispatch, emphasizing trade-offs between performance and
