题解 | 杨辉三角-ii

#
# 
# @param rowIndex int整型 
# @return int整型一维数组
#
class Solution:
    def getRow(self , rowIndex ):
        # write code here
        list_1 = [1]*(rowIndex+1)
        for i in range(1,rowIndex):
            for j in range(i,0,-1):
                list_1[j]= list_1[j]+list_1[j-1]
        return list_1