38. Count and Say

原题

The count-and-say sequence is the sequence of integers with the first five terms as following:

1. 1
2. 11
3. 21
4. 1211
5. 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 term of the count-and-say sequence.

Note: Each term of the sequence of integers will be represented as a string.

Example 1:

Input: 1
Output: “1”

Example 2:

Input: 4
Output: “1211”

代码实现

    public string CountAndSay(int n) {
        int i=0;
        string tmp="1";
        while(++i<n){
            var newtmp= new StringBuilder();
            for(int j=0;j<tmp.Length;){
                char ch=tmp[j];
                int nj=0;
                while(j<tmp.Length && ch==tmp[j]){ 
                    nj++;
                    j++;
                }
                //get the count of ch
                newtmp.Append(string.Format("{0}{1}",nj,ch));
            }
            // get the new string for iteratoring
            tmp = newtmp.ToString(); 
        }
        return tmp;
    }

题库

Leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp

完成题目索引

http://blog.csdn.net/daigualu/article/details/73008186