LeetCode 38. Count and Say

https://leetcode.com/problems/count-and-say/description/

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, 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"

Hide Hint 1  
The following are the terms from n=1 to n=10 of the count-and-say sequence:
 1.     1
 2.     11
 3.     21
 4.     1211
 5.     111221 
 6.     312211
 7.     13112221
 8.     1113213211
 9.     31131211131221
10.     13211311123113112211
Hide Hint 2   
To generate the  nth term, just  count and say the  n-1th term.

  • 字符串简单题。主要是分析清楚模拟算法。
  • to_string - C++ Reference
    • http://www.cplusplus.com/reference/string/to_string/
 1 //
 2 //  main.cpp
 3 //  LeetCode
 4 //
 5 //  Created by Hao on 2017/3/16.
 6 //  Copyright © 2017年 Hao. All rights reserved.
 7 //
 8 
 9 #include <iostream>
10 #include <cstring>
11 #include <vector>
12 using namespace std;
13 
14 class Solution {
15 public:
16     string countAndSay(int n) {
17         if (n <= 0) return ""; // corner case
18         
19         string sResult = "1", sTemp = "";
20         int count = 0, j = 0;
21         
22         for (int i = 1; i < n; i ++) {
23             j = 0;
24             sTemp = "";
25             
26             while (j < sResult.size()) {
27                 count = 1;
28                 
29                 while (j + 1 < sResult.size() && sResult.at(j) == sResult.at(j + 1)) {
30                     ++ j;
31                     ++ count;
32                 }
33                 
34                 sTemp = sTemp + to_string(count) + sResult.at(j);
35                 
36                 ++ j;
37             }
38             
39             sResult = sTemp;
40         }
41         
42         return sResult;
43     }
44 };
45 
46 int main(int argc, char* argv[])
47 {
48     Solution    testSolution;
49     string      result;
50     
51     vector<int> iVec = {0, 1, 2, 3, 4, 5};
52     
53     /*
54      
55      1
56      11
57      21
58      1211
59      111221
60      */
61     for (auto i : iVec) {
62         cout << testSolution.countAndSay(i) << endl;
63     }
64 
65     return 0;
66 }
View Code

 



转载于:https://www.cnblogs.com/pegasus923/p/8422114.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值