程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode題目9 Count and Say

LeetCode題目9 Count and Say

編輯:C++入門知識

題目:
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.

代碼:

[cpp]
string cas_next(const string & cas) { 
 
    string ret; 
    char cur_str=cas.at(0); 
    int num=0; 
    for (int i=0;i<cas.length();i++) 
    { 
            if (cur_str==cas.at(i)) 
            { 
                num++; 
            } 
            else{ 
                stringstream ss; 
                ss<<num<<cur_str; 
                ret+=ss.str(); 
                cur_str=cas.at(i); 
                num=1; 
            } 
    } 
     if (num > 0)     {       
         stringstream ss;                    
         ss << num << cur_str;                 
         ret += ss.str();       
     } 
    return ret; 
     

[cpp] view plaincopy
string countAndSay(int n) { 
         
     if (n < 1)     return "";  
     string s="1"; 
    for (int i=1;i<n;i++) 
   { 
       s=cas_next(s); 
   } 
    return s; 


作者:doublechen

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved