1
class Solution:
2
def getRow(self, rowIndex: int) -> List[int]:
3
# base case
4
# we know that there exist two base case one which is for zero input
5
# One when we have to exit our recursive loop
6
if rowIndex == 0:
7
return [1]
8
if rowIndex == 1:
9
return [1, 1]
10
# recurance relation or prev call
11
prev_prob = self.getRow(rowIndex - 1)
12
# post processing on data
13
# if someone has given us prev_Row what operation we can perform to get current_Row
14
return (
15
[1]
16
+ [prev_prob[i] + prev_prob[i - 1] for i in range(1, len(prev_prob))]
17
+ [1]
18
)

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0