leetcode 38. Count and Say

最新推荐文章于 2022-10-18 17:45:00 发布

moli2333

最新推荐文章于 2022-10-18 17:45:00 发布

阅读量151

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/wl0627/article/details/52513820

版权

leetcode 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

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.

理解题意：
首先如果把每一位取出来看的话就是看这一位和下一位一不一样一样就计算器加一不一样就计数器清零
所以只用两个变量一个count 一个value应该就够了

11213
1：                   value:1    count:1
11:                   value:1    count:2    
112:                  value:2    count:1    输出21
1121:                 value:1    count:1    输出21
11213:                value:3    count:1    输出11                                                                                                                    输出13

public String countAndSay(int n) {
        String[] strings = new String[n];
        for(int i = 0;i < n;i++){
            if(i == 0) strings[i] = "1";
            else strings[i] = countAndSayForString(strings[i-1]);
        }
        return strings[n-1];
    }

    public String countAndSayForString(String s) {
        StringBuffer result = new StringBuffer();
        int count = 0;
        char value = ' ';
        for(char c:s.toCharArray()){
            if(c != value){
                if(value != ' '){
                    result.append(count + "" + value);
                } 
                value = c;
                count = 1;
            }
            else {
                count ++;
            }
        }
        result.append(count + "" + value);
        return result.toString();
    }