leetcode-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.

class Solution {
    public String countAndSay(int n) {
        if(n==1) return "1";
        String str = countAndSay(n-1);
        String res = new String();
        for(int i=0; i<str.length();i++ ){
            int count = 1;
            while(i<str.length()-1 && str.charAt(i)==str.charAt(i+1)){
                i++;
                count++;
            }
            res = res+String.valueOf(count);
            res = res+String.valueOf(str.charAt(i));
        }
        return res;
    }
}

主要是要理解题目的意思，其次注意字符串连接末尾的情况，给出的程序处理的挺好的