Count and Say

recursion programming

public class Solution {
    public String countAndSay(int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(n == 1)
            return "1";
        char[] mychar = countAndSay(n-1).toCharArray();
        String result = "";
        char tmp = ' ';
        int count = 0;
        for(int i = 0; i < mychar.length; i++)
        {
            if(mychar[i] != tmp)
            {
                if(tmp == ' ')
                {
                    tmp = mychar[i];
                    count = 1;
                }
                else
                {
                    result += String.valueOf(count) + tmp;
                    tmp = mychar[i];
                    count = 1;
                }
            }
            else
            {
                count++;
            }
        }
        result += String.valueOf(count) + tmp;
        return result;
    }
}