Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.
If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".
The string is compressed only when the repeated character count is more than 1.
The consecutive count of every character in the input string is less than or equal to 9.
The first line contains an integer 'T' which denotes the number of test cases or queries to be run.
The first line of each test case contains one string ‘S’ denoting the input string that needs to be compressed.
For each case, we need to print a string representing the compressed string.
The output of each test case will be printed in a separate line.
You do not need to input or print anything, and it has already been taken care of. Just implement the given function.
1 <= T <= 5
1 <= |S| <= 5000
Where |S| is the size of the string.
Time Limit: 1 sec
Sample Input 1:
Sample Output 1:
Explanation of Sample Input 1:
Test case 1:
For the first test case of sample output 1, our compressed string is “a3b2d2c3”. It represents that the string contains 3 consecutive ‘a’, 2 consecutive ‘b’, 2 consecutive ‘d’, and 3 consecutive ‘c’.
Sample Input 2:
Sample Output 2:
Explanation of Sample Input 2:
Test case 1:
For the first test case of sample output 2, our compressed string is ‘xyz3’. As the occurrence of ‘x’ and ‘y’ is 1, hence we do not need to add the count of their repetitions. For the last character ‘z’, we have 3 repetitions.