Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 74151 Accepted Submission(s): 32828
Problem DescriptionGiven 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.InputThe 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.OutputFor each test case, output the encoded string in a line.Sample Input2ABCABBCCCSample OutputABCA2B3C
思路还是很简单的,找是不是有重复的字符,有多少个 ,如果只有一个就不显示数字,如果多个就显示出具体有几个。代码如下:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int N=scanner.nextInt();
for(int i=0;i<N;i++) {
String str=scanner.next();
int k=1;
for(int j=1;j<str.length();j++) {
if(cf(str.charAt(j-1), str.charAt(j))) {
k++;
}
else {
if(k==1) {
System.out.print(str.charAt(j-1));
}
else {
System.out.print(k+""+str.charAt(j-1));
k=1;
}
}
}
if(k==1) {
System.out.println(str.charAt(str.length()-1));
}
else {
System.out.println(k+""+str.charAt(str.length()-1));
}
}
scanner.close();
}
//判断前后两个字符是否相等
public static boolean cf(char a,char b) {
if(a==b) return true;
return false;
}
}