leetcode 118. Pascal's Triangle python
2018-04-07 22:00
309 查看
class Solution(object): def generate(self, numRows): """ :type numRows: int :rtype: List[List[int]] """ list = [] for i in range(0,numRows): list.append([1]*(i+1)) if i > 1: for j in range(1,i): list[i][j] = list[i-1][j-1] + list[i-1][j] return list先建立[[1],[1,1],[1,1,1],[1,1,1,1]],再对数组内部进行替换。
相关文章推荐
- LeetCode118. Pascal's Triangle-python(easy)
- [LeetCode By Python]118. Pascal's Triangle
- [leetcode, python] Pascal's Triangle II 杨辉三角
- leetcode 118. Pascal's Triangle c++
- Leetcode 118. Pascal's Triangle
- [leetcode, python] Pascal's Triangle II 杨辉三角
- leetcode刷题记录-118. Pascal's Triangle
- <LeetCode OJ> 118./119. Pascal's Triangle(I / II)
- LeetCode 118. Pascal's Triangle(帕斯卡三角)
- LeetCode 118. Pascal's Triangle
- [leetcode, python] Pascal's Triangle II 杨辉三角
- LeetCode 118. Pascal's Triangle
- 118. Pascal's Triangle LeetCode
- 【LeetCode】118. Pascal's Triangle
- [LeetCode]118. Pascal's Triangle
- [leetcode, python] Pascal's Triangle II 杨辉三角
- 【Leetcode】【python】Pascal's Triangle, Pascal's Triangle II
- LeetCode-Array-118. Pascal's Triangle
- 【Leetcode】118. Pascal's Triangle
- 【Leetcode】118. Pascal's Triangle