1 解题思想
这道题的就是,有一个只包含1和2的字符串,他有一个神奇的特性:
*如果将字符串按照1和2分组后,统计每组1或2出现的次数所拼接成的字符串,和这个字符串本身一样
我没做这道题。。感觉太烦,直接贴的别人的答案了,有兴趣我再来自己写
2 原题
A magical string S consists of only '1' and '2' and obeys the following rules:
The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates the string S itself.
The first few elements of string S