Replace two consecutive equal values with one greater

You are given an array of size ‘n’. You have to replace every pair of consecutive values ‘x’ by a single value ‘x+1’ every time until there is no such repetition left and then print the new array.

Input : 5, 2, 1, 1, 2, 2
Output : 5 4
Explanation:
step 1: While traversing, encountered pair of 1(gets replaced by 2. We get 5, 2, 2, 2, 2
step 2: The first encountered pair of 2 gets replaced by 3. We get 5, 3, 2, 2
step 3: Again pair of 2 gets replaced by 3. We get 5, 3, 3
step 4: Recently formed pair of 3 gets replaced by 4. We get 5, 4
This is our required answer.

Input : 4, 5, 11, 2, 5, 7, 2
Output : 4 5 11 2 5 7 2

Approach : In this problem you have to traverse the array of integers and check if any two consecutive integers are of a same value X. Then you have to replace that pair of integers with a single integer X+1. After that you have to begin with a new step by re-traversing the array and performing the same operation.

C++


[sourcecode language=”CPP” highlight=””]
// C++ program to replace two elements with equal
// values with one greater.
#include <bits/stdc++.h>
using namespace std;

// Function to replace consecutive equal
// elements
void replace_elements(int arr[], int n)
{
int pos = 0; // Index in result

for (int i = 0; i < n; i++) {
arr[pos++] = arr[i];

while (pos > 1 && arr[pos – 2] ==
arr[pos – 1]) {
pos–;
arr[pos – 1]++;
}
}

// to print new array
for (int i = 0; i < pos; i++)
cout << arr[i] << " ";
}

// Driver Code
int main()
{
int arr[] = { 6, 4, 3, 4, 3, 3, 5 };
int n = sizeof(arr) / sizeof(int);
replace_elements(arr, n);
return 0;
}
[/sourcecode]

Output:

6 4 3 6


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : Sam007



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.