递推查数序列 Count and Say Sequence

题目：所谓的递推查数数列如下所示:

                                            1, 11, 21, 1211, 111221, ....

1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2, then one 1" or 1211.Given an integer n, generate the nth sequence.Note: The sequence of integers will be represented as a string.
分析：按照字符串先后顺序计算相邻相同数字数目，按照“个数+数字+个数+数字......”顺序为下一个数列。

代码：

点击(此处)折叠或打开

1. #include
   
2. 
   
3. using namespace std;
   
4. 
   
5. classTest
   
6. {
   
7.     public:
   
8.         bool nextSeq(constchar*src,char*dest)
   
9.         {
   
10.             char tmp=NULL;
    
11.             intcount=0;
    
12. 
    
13.             if((NULL==src)||(NULL==dest))
    
14.                 returnfalse;
    
15. 
    
16.             while(*src!='\0')
    
17.             {
    
18.                 if((*src>='1')&&(*src<='9'))
    
19.                 {
    
20.                     if(*src==tmp)
    
21.                     {
    
22.                         count++;
    
23.                         src++;
    
24.                     }
    
25.                     else
    
26.                     {
    
27.                         if(count>0)
    
28.                         {
    
29.                             *dest++='0'+count;
    
30.                             *dest++=tmp;
    
31.                         }
    
32.                         tmp=*src;
    
33.                         count=1;
    
34.                         src++;
    
35.                     }
    
36.                 }
    
37.             }
    
38.             if(count>0)
    
39.             {
    
40.                 *dest++='0'+count;
    
41.                 *dest++=tmp;
    
42.             }
    
43.             *dest='\0';
    
44.             returntrue;
    
45.         }
    
46. };
    
47. 
    
48. intmain()
    
49. {
    
50.     cout<<"hello world"<
51. 
    
52.     char str[100]={0};
    
53.     classTest my_test;
    
54.     cout<
55.     cout<
56. }