标签：java   leetcode   递归   string   

题目

方法

循环求解。

    public String countAndSay(int n) {
        if (n == 0) {
            return null;
        }
        String str = "1";
        for (int i = 1; i < n; i++) {
            int len = str.length();
            char ch = str.charAt(0);
            int count = 1;
            StringBuilder builder = new StringBuilder();
            for (int j = 1; j < len; j++) {
                if (str.charAt(j) == ch) {
                    count++;
                } else {
                    builder.append(count + "" + ch);
                    ch = str.charAt(j);
                    count = 1;
                }
            }
            builder.append(count + "" + ch);
            str = builder.toString();
        }
        
        return str;
    }

Count and Say,布布扣,bubuko.com

Count and Say

标签：java   leetcode   递归   string   

原文地址：http://blog.csdn.net/u010378705/article/details/30329671