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.

Example:

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. 

Implementation:

6 4 3 6 

Complexity Analysis:

• Time Complexity: O(N²)
• Auxiliary Space: O(1)