zoukankan      html  css  js  c++  java
  • 38. Count and Say

    The count-and-say sequence is the sequence of integers with the first five terms as following:

    1.     1
    2.     11
    3.     21
    4.     1211
    5.     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 where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence.

    Note: Each term of the sequence of integers will be represented as a string.

    Example 1:

    Input: 1
    Output: "1"
    

    Example 2:

    Input: 4
    Output: "1211"

     1 class Solution {
     2 public:
     3     string countAndSay(int n) {
     4         string cur="1";
     5         
     6         for(int i=1;i<n;++i)
     7         {
     8             int n=1;
     9             string tmp;
    10             for(int i=0;i<cur.size();++i)
    11             {
    12                 if(i<cur.size()-1&&cur[i]==cur[i+1])
    13                 {
    14                     ++n;
    15                     continue;
    16                 }
    17                 tmp+=to_string(n)+cur[i];
    18                 n=1;
    19             }
    20             cur=tmp;
    21         }
    22         return cur;
    23     }
    24 };
    
    
  • 相关阅读:
    DBHelper
    jsTree使用
    爬虫系列之Scrapy框架
    Mongodb安装
    爬虫系列之mongodb
    爬虫学习目录
    爬虫之selenium模块
    爬虫简介与requests模块
    爬虫数据解析的三方式
    线程相关
  • 原文地址:https://www.cnblogs.com/lychnis/p/11704808.html
Copyright © 2011-2022 走看看