leetcode: 119. Pascal's Triangle II

版权声明：转载请注明出处 https://blog.csdn.net/JNingWei/article/details/83817610

Difficulty

Easy.

Problem

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?

AC

class Solution():
    def getRow(self, n):
        if n == 0:
            return [1]
        else:
            level = self.getRow(n-1)
            return list(map(lambda x, y: x+y, [0]+level, level+[0]))