LeetCode: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 n^th sequence.

Note: The sequence of integers will be represented as a string.

public class Solution {    public String countAndSay(int n) {        if(n == 0) return "";        if(n == 1) return "1";        StringBuilder ret = new StringBuilder("1");               for(int i = 1;i < n;i++){        StringBuilder s = new StringBuilder();        int len = ret.length();        int j = 0;        while(j < len){        int count = 1;        while((j < len-1)         && (ret.charAt(j) == ret.charAt(j+1))){        count++;        j++;        }        s.append(count+"").append(ret.charAt(j));        j++;        }        ret = s;        }        return ret.toString();    }}