The count-and-say sequence is the sequence of integers beginning as follows: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.
string say; string countAndSay(int n) { if(n == 1) return "1"; say = "1"; //return say "n - 1" for(int i = 1;i < n;i++) { string tmp = ""; char cur = say[0]; int count = 1; for(int j = 1;j < say.length();j++) { if(say[j] == cur) { count++; } else { tmp = tmp + char(count + ‘0‘) + cur; cur = say[j]; count = 1; } } tmp = tmp + char(count + ‘0‘) + cur; say = tmp; } return say; }
[LeetCode] Count and Say,布布扣,bubuko.com
原文：http://www.cnblogs.com/changchengxiao/p/3840483.html
