Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
easy to solve
class Solution:
# @return a list of integers
def getRow(self, rowIndex):
if rowIndex==0:
return [1]
result = [1]
for rowInd in range(1,rowIndex+1):
for elemind in range(len(result)-1,0,-1):
result[elemind] = result[elemind] + result[elemind-1]
result = result + [1]
return result