We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b079d3a commit 712485bCopy full SHA for 712485b
yang_hui_triangle.py
@@ -0,0 +1,21 @@
1
+class Solution:
2
+ """
3
+ @param n: a Integer
4
+ @return: the first n-line Yang Hui's triangle
5
6
+ def calcYangHuisTriangle(self, n):
7
+ # write your code here
8
+ if n == 0:
9
+ return []
10
+ else:
11
+ ret = [[1]]
12
+ for i in range(1, n):
13
+ prev_level = ret[-1]
14
+ new_level = [1]
15
+ for i in range(len(prev_level) - 1):
16
+ new_level.append(prev_level[i] + prev_level[i + 1])
17
+ new_level.append(1)
18
+ ret.append(new_level)
19
+ return ret
20
+
21
+# easy: http://lintcode.com/zh-cn/problem/yang-hui-triangle/
0 commit comments