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

    class Solution {
    public:
        string countAndSay(int n) 
        {
            if(n==0return "";
            string s="1";
            for(int i=2;i<=n;i++)
                s=count(s);
            return s;
        }
        string count(string s)
        {
            string result="";
            int index=0;
            while(index<s.length())
            {
                int cnt=0;
                char c=s[index];
                while(index<s.length() && s[index]==c)
                {
                    index++;
                    cnt++;
                }
                result=result+char('0'+cnt);
                result=result+c;
            }
            return result;
        }
    }; 
  • 相关阅读:
    loadrunner Message函数
    loadrunner informational函数
    loadrunner database函数
    loadrunner CommandLine函数
    loadrunner重播函数
    loadrnner header函数
    KVM虚拟机的xml配置文件
    cinder-backup驱动配置
    Areon 删除linux软raid方法
    Mdadm命令详解
  • 原文地址:https://www.cnblogs.com/erictanghu/p/3759346.html
Copyright © 2011-2022 走看看