leetcode 刷题 118 119

class Solution: def generate(self, numRows: int) -> List[List[int]]:
# pascal = [[1]*(i+1) for i in range(numRows)]
# for i in range(numRows):
# for j in range(1,i):
# pascal[i][j] = pascal[i-1][j-1] + pascal[i-1][j]
# return pascal res, row = [], [1] for _ in range(numRows): res.append(row) row = [1] + [row[i]+row[i-1] for i in range(1, len(row))] + [1] return res

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
 

class Solution: def getRow(self, rowIndex: int) -> List[int]: """ :type rowIndex: int :rtype: List[int] """ # pascal = [1]*(rowIndex + 1) # for i in range(2,rowIndex+1): # for j in range(i-1,0,-1): # pascal[j] += pascal[j-1] # return pascal if rowIndex == 0: return [1] row = [1, 1] for i in range(1, rowIndex): row = [1] + [x+y for x, y in zip(row, row[1:])] + [1] return row

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90733904