19.2.3 [LeetCode 38] Count and Say

阿新 • • 發佈：2019-02-03

clas n+1 編號 opened terms 題解 inpu represent !=

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"

題意

題意相當腦殘，都沒寫清楚

就是n+1編號的字符串是以count-and-say形式復述編號n的字符串的結果

題解

技術分享圖片

 1 class Solution {
 
 2 public:
 3     string countAndSay(int n) {
 4         string ans = "1";
 5         n--;
 6         while (n--) {
 7             string tmp = "";
 8             int p = 0, l = ans.length();
 9             for (int i = 1; i < l; i++) {
10                 if (ans[i - 1] != ans[i]) {
11                     char 
 ch = i - p + ‘0‘;
12                     tmp += ch;
13                     ch = ans[i - 1];
14                     tmp += ch;
15                     p = i;
16                 }
17             }
18             char ch = l - p + ‘0‘;
19             tmp += ch;
20             ch = ans[l - 1];
21             tmp += ch;
22             ans = tmp;
23         }
24         return ans;
25     }
26 };

View Code

19.2.3 [LeetCode 38] Count and Say

19.2.3 [LeetCode 38] Count and Say

clas n+1 編號 opened terms 題解 inpu represent != The count-and-say sequence is the sequence of integers with the first five terms as followi

leetcode-38 Count And Say

pop -m seq rac note 不變 article ger else 問題描寫敘述： The count-and-say sequence is the sequence of integersbeginning as follows: 1, 11,

LeetCode 38: Count and Say

log mat rate and style valueof dsa blog res class Solution { public String countAndSay(int n) { if (n == 0) { re

[LeetCode] 38. Count and Say 計數和讀法

相同 output for ews represent class urn present count The count-and-say sequence is the sequence of integers with the first five terms as f

LeetCode-38. Count and Say

0.原題 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.

[leetcode]38. Count and Say

健身完回來狀態不好，先做個easy吧這個破題的decription有歧義吧，簡直了。 Solution 1: 沒什麼技術含量的遍歷每執行一個count的時間複雜度是m（就是這一遍的長度），一共執行了n次這樣的count，m又是一個增長的量。但是我不知道m的增長速率。我覺得時間複雜

LeetCode--38. Count and Say

今早心血來潮想找一條easy題刷一下，就找了個字串的題目：https://leetcode.com/problems/count-and-say/ 這個題目雖然是easy題目，但題意理解起來需要一會兒呢。

leetcode 38. Count and Say

題目解釋有點繞：大致意思是 1 可以讀作 1個1（11） 11可以讀作2個1（21）.。。。明白題意後，可以想到，遍歷字串，計數重複的數字，連線字串即可 class Solution { public: string countAndSay(int n

LeetCode---38. Count and Say

LeetCode—38. Count and Say 題目 https://leetcode.com/problems/count-and-say/description/ 計數併發言。 n=1，輸出1； n=2，上次輸出一個1，所以輸出11； n=3，上次輸出

leetcode-38-Count and Say

The algorithm is easy, following what the problem want us to do. But we always need to care about the detail. Always remember to handle the stri

Leetcode 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. 111

#leetcode#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

LeetCode 38. 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"

leetCode 38.Count and Say (計數和發言) 解題思路和方法

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

【leetcode】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.

38. Count and Say

integer ive output while each int result first seq The count-and-say sequence is the sequence of integers with the first five terms as f

LeeCode from 0 ——38. Count and Say

urn ++ temp ont RM fir IT The family 38. Count and Say The count-and-say sequence is the sequence of integers with the first five terms a

38. Count and Say 題目解釋

註意 ron 輸出 n-1 tail .net -a 字符描述初看題目很迷，Google看了各大神的解釋，才明白原題連接：https://leetcode.com/problems/count-and-say/description/ 題目解釋：原題的意思就是用一個

LeetCode Day31 count-and-say

class Solution { public: string countAndSay(int n) { if (n <= 0) return ""; string res = "1"; while (--n) {

LeetCode：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