38. 外观数列

package leetcode;

public class demo_38 {
    public String countAndSay(int n) {
        String s="1";
        int j=1;
        for(int m=1;m<n;m++) {
            String s1="";
            for(int i=0;i<s.length();i++) {
                try {
                    if(s.charAt(i)==s.charAt(i+1)&&i!=s.length()-1){
                        j=j+1;
                        continue;
                    }
                } catch (Exception e) {
                    // TODO: handle exception
                }
                s1=s1+String.valueOf(j);
                s1=s1+s.charAt(i);
                j=1;
            }
            s=s1;
        }
        System.out.println(s);
        return s;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_38 d38=new demo_38();
        d38.countAndSay(4);        
    }
}