【字符串】Count and Say

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.

题意：由前一个数字串生成下一个数字串，如1表示1个1，所以下一数字串则是11；11则表示2个1——>下一个为21；依次类推

所以遍历字符串将每个数字的连续次数求出，以此生成下一个字符串

public class Solution {
    
    public String func(String s){
        if(s == null) return null;
        
        int len = s.length();
        StringBuilder sb = new StringBuilder();
        for(int i=0; i<len;){
            char t = s.charAt(i++);
            int count = 1;
            while(i<len && t==s.charAt(i)){
                i++;
                count++;
            }
            sb.append(count).append(t);
        }
        return sb.toString();
    }
    
    public String countAndSay(int n) {
        String res = "1";
        for(int i=1; i<n; i++){
            res = func(res);
        }
        return res;
    }
}