这篇博客介绍了HDU 1020问题的解决方案，涉及字符串编码方法：连续相同字符的子串会被编码为'kX'形式，其中X是字符，k是其出现次数。题目给出输入输出样例，并分析了编程实现时可能的错误点，包括未针对连续字符整合和误处理末尾换行。
Encoding
Problem Description
Given a string containing only ‘A’ - ‘Z’, we could encode it using the following method:
Each sub-string containing k same characters should be encoded to “kX” where “X” is the only character in this sub-string.
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
分析:
将每个字母所连续的次数k, 整合成”k字母”的形式输出
错误点1: 没有仔细读题, 将整个字符串中所有同种字母整合成k的情况 <
最低0.47元/天 解锁文章
1412
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
