经典算法–字符串的匹配压缩
import java.util.*;
public class One {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("输入一个字符串:");
String s = sc.next();
char[] chars = s.toCharArray();
//记录出现的字符
char a = ' ';
//记录字符出现次数
int b = 1;
//压缩后的字符串
String s1 = "";
for (int i = 0; i < chars.length ; i++) {
if(a==chars[i]){
b++;
}else{
if(a!=' '){
s1 += b;
s1 += a;
a = chars[i];
b = 1;
}else{
a = chars[i];
}
}
}
s1 += b;
s1 += a;
System.out.println(s1);
}
}