leetcode day20杨辉三角

1.题目描述

2.代码构思（debug）

class Solution:

def generate(self, numRows: int) -> List[List[int]]:
    if numRows <= 0:
        return 
    if numRows == 1:
        return [[1]]
    if numRows == 2:
        return [[1],[1,1]]

    ret = list()
    for i in range(numRows):
        row = list()
        for j in range(0, i + 1):
            if j == 0 or j == i:
                row.append(1)
            else:
                row.append(ret[i - 1][j] + ret[i - 1][j - 1])
        ret.append(row)
        
    return ret

杨辉三角ii，返回某一特定行数据
class Solution:

def getRow(self, rowIndex: int) -> List[int]:

    ret = []
    for i in range(rowIndex + 1):
        ret.append([1 for n in range(i+1)])
    for i in range(2, rowIndex + 1):
        for j in range(1, i):
            ret[i][j] = ret[i-1][j-1] + ret[i-1][j]
    return ret[rowIndex]