Pascal ' s triangle II leetcode Python

Given an index k, return the kth row of the Pascal ' s triangle.


For example, given k = 3,
Return [1,3,3,1].


Note:

Could optimize your algorithm to use only O (k) extra space?

The difference between this and the previous one is that instead of returning all the solutions, you just need to return to the index corresponding row. The procedure defines a currow and Prerow as before

Class solution:    # @return A list of integers    def getRow (self, rowIndex):        rownum=rowindex+1        currow=[1]< C5/>if rownum==1:            return currow        if rownum>0:            currow=[1] for            index in range (rownum):                prerow= Currow                Currow=[1] for                J in Range (index-1):                    currow.append (prerow[j]+prerow[j+1])                currow.append (1)        Return Currow

Pascal ' s triangle II leetcode Python