Skip to content

Commit f7d73ec

Browse files
committed
update at 2017-06-08
1 parent eb3986e commit f7d73ec

File tree

2 files changed

+25
-7
lines changed

2 files changed

+25
-7
lines changed

038-count-and-say/count-and-say.py

Lines changed: 22 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,13 @@
11
# -*- coding:utf-8 -*-
22

33

4-
# The count-and-say sequence is the sequence of integers beginning as follows:
5-
# 1, 11, 21, 1211, 111221, ...
4+
# The count-and-say sequence is the sequence of integers with the first five terms as following:
5+
#
6+
# 1. 1
7+
# 2. 11
8+
# 3. 21
9+
# 4. 1211
10+
# 5. 111221
611
#
712
#
813
#
@@ -12,11 +17,24 @@
1217
#
1318
#
1419
#
15-
# Given an integer n, generate the nth sequence.
20+
# Given an integer n, generate the nth term of the count-and-say sequence.
21+
#
22+
#
23+
#
24+
# Note: Each term of the sequence of integers will be represented as a string.
25+
#
26+
#
27+
# Example 1:
28+
#
29+
# Input: 1
30+
# Output: "1"
31+
#
1632
#
1733
#
34+
# Example 2:
1835
#
19-
# Note: The sequence of integers will be represented as a string.
36+
# Input: 4
37+
# Output: "1211"
2038

2139

2240
class Solution(object):

README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# :pencil2: Leetcode Solutions with Python,Golang
2-
Update time: 2017-06-07 04:19:44
2+
Update time: 2017-06-08 04:22:27
33

44
Auto created by [leetcode_generate](https://github.com/bonfy/leetcode)
55

@@ -264,7 +264,7 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
264264
|263|[ugly-number](https://leetcode.com/problems/ugly-number)|[Python](https://github.com/bonfy/leetcode/blob/master/263-ugly-number/ugly-number.py)||Easy|
265265
|264|[ugly-number-ii](https://leetcode.com/problems/ugly-number-ii)|[Python](https://github.com/bonfy/leetcode/blob/master/264-ugly-number-ii/ugly-number-ii.py)||Medium|
266266
|265|[paint-house-ii](https://leetcode.com/problems/paint-house-ii)|:lock:||Hard|
267-
|266|[palindrome-permutation](https://leetcode.com/problems/palindrome-permutation)|:lock:||Easy|
267+
|266|[palindrome-permutation](https://leetcode.com/problems/palindrome-permutation)|:lock:|[:memo:](https://leetcode.com/articles/palindrome-permutation/)|Easy|
268268
|267|[palindrome-permutation-ii](https://leetcode.com/problems/palindrome-permutation-ii)|:lock:||Medium|
269269
|268|[missing-number](https://leetcode.com/problems/missing-number)|||Easy|
270270
|269|[alien-dictionary](https://leetcode.com/problems/alien-dictionary)|:lock:||Hard|
@@ -469,7 +469,7 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
469469
|481|[magical-string](https://leetcode.com/problems/magical-string)|||Medium|
470470
|482|[license-key-formatting](https://leetcode.com/problems/license-key-formatting)|||Medium|
471471
|483|[smallest-good-base](https://leetcode.com/problems/smallest-good-base)|||Hard|
472-
|484|[find-permutation](https://leetcode.com/problems/find-permutation)|:lock:||Medium|
472+
|484|[find-permutation](https://leetcode.com/problems/find-permutation)|:lock:|[:memo:](https://leetcode.com/articles/find-permutation/)|Medium|
473473
|485|[max-consecutive-ones](https://leetcode.com/problems/max-consecutive-ones)|[Python](https://github.com/bonfy/leetcode/blob/master/485-max-consecutive-ones/max-consecutive-ones.py)||Easy|
474474
|486|[predict-the-winner](https://leetcode.com/problems/predict-the-winner)|||Medium|
475475
|487|[max-consecutive-ones-ii](https://leetcode.com/problems/max-consecutive-ones-ii)|:lock:||Medium|

0 commit comments

Comments
 (0)