Problem Description
Given a string containing only 'A' - 'Z', we could encode it using the following method:
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
Input
The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.
Output
For each test case, output the encoded string in a line.
Sample Input
2 ABC ABBCCC
Sample Output
ABC A2B3C
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int T = in.nextInt();
in.nextLine();
while(T>0){
String s = in.nextLine();
if(s.length()==1)
{System.out.println(s);continue;}
char ch = 0,next=0;
int sum=1;
for(int i=0;i<s.length()-1;i++){
ch = s.charAt(i);
next = s.charAt(i+1);
if(ch==next)
sum++;
else
{if(sum!=1)System.out.print(sum+""+ch);
else System.out.print(ch);
sum=1;}
}
if(next==ch)
System.out.println(sum+""+ch);
else
System.out.println(next);
T--;
}
}
}