[38] Count and Say

Published on in LeetCode with views and comments
本文最后更新于 2190 天前，其中的信息可能已经不够准确，请您酌情参考！

题目

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

1is read off as"one 1"or11.
11is read off as"two 1s"or21.
21is read off as"one 2, thenone 1"or1211.

Given an integer_n_ where 1 ≤_n_≤ 30, generate the_n_thterm 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"

解法

一

思路

遍历时使用变量记录当前数字及次数

代码

LeetCode.38.1.png


↑ ↓