继续水题。用队列轻松解决
----------------------------------------------------------
import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
ArrayList<NameValuePair> pairs = new ArrayList<NameValuePair>();
Character currentChar = null;
int count = s.nextInt();
for(int i = 1;i<=count;i++){
String str = s.next();
pairs.clear();
for(int j = 0;j<str.length();j++){
Character c = str.charAt(j);
if(c == currentChar){
pairs.get(pairs.size()-1).add();
}else{
currentChar = c;
pairs.add(new NameValuePair(c));
}
}
for(int j = 0;j<pairs.size();j++){
System.out.print(pairs.get(j).toString());
}
System.out.println();
}
}
}
class NameValuePair{
public int count = 1;
public Character c;
public NameValuePair(Character c){
this.c = c;
}
public void add(){
this.count++;
}
@Override
public String toString() {
if(count == 1){
return c.toString();
}
return ""+count+c.toString();
}
}
-----------------------------------------------------------