leetcode38

public class Solution {
    public string CountAndSay(int n) {
        //1
            //11
            //21
            //1211
            //111221
            //312211
            //13112221
            //1113213211            

            if (n == )
            {
                return "";
            }
            else
            {
                var list = new List<string>();
                list.Add("");
                var result = "";
                var pre = "";
                for (int i = ; i < n; i++)
                {
                    pre = list[i - ];
                    var c = pre[];
                    var newrow = new StringBuilder();
                    var count = ;
                    for (int j = ; j < pre.Length; j++)
                    {
                        var cur = pre[j];
                        if (c != cur)
                        {
                            newrow.Append(count).Append(c);
                            count = ;
                            c = cur;
                        }
                        else
                        {
                            count++;
                        }
                    }
                    newrow.Append(count).Append(c);
                    list.Add(newrow.ToString());
                }
                result = list[list.Count - ];
                return result;
            }
    }
}

https://leetcode.com/problems/count-and-say/#/description