LeetCode---Pascal's Triangle II

Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.

Note that the row index starts from 0.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 3
Output: [1,3,3,1]

Follow up:

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

这道题与前一题还是有区别的，此题只返回第n行，而且下标起点也不一样了（rowIndex首先应该加个1）

class Solution:
    def getRow(self, rowIndex):
        rowIndex+=1
        ret=[]
        for i in range(rowIndex):
            ret.append([1])
            for j in range(1,i+1):
                if j==i:
                    ret[i].append(1)
                else:
                    ret[i].append(ret[i-1][j]+ret[i-1][j-1])
        return ret[rowIndex-1]