zoukankan      html  css  js  c++  java
  • [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 nth sequence.

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

    string say;
    string countAndSay(int n) {
            if(n == 1) return "1";
            say = "1";
            //return say "n - 1"
            for(int i = 1;i < n;i++)
            {
                string tmp = "";
                char cur = say[0];
                int count = 1;
                for(int j = 1;j < say.length();j++)
                {
                    if(say[j] == cur)
                    {
                        count++;
                    }
                    else
                    {
                        tmp = tmp + char(count + '0') + cur;
                        cur = say[j];
                        count = 1;
                    }
                }
                tmp = tmp + char(count + '0') + cur;
                say = tmp;
            }
            return say;
        }
    View Code
  • 相关阅读:
    “访问”美术馆
    加分二叉树
    有线电视网
    二叉苹果树
    鬼子进村
    遍历问题
    最大子树和
    FBI树
    求前序遍历
    JS如何实现点击页面内任意的链接均加参数跳转?
  • 原文地址:https://www.cnblogs.com/changchengxiao/p/3840483.html
Copyright © 2011-2022 走看看