Pascal's Triangle II

最新推荐文章于 2022-02-27 22:46:37 发布

爱折腾的猫

最新推荐文章于 2022-02-27 22:46:37 发布

阅读量4k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/guang09080908/article/details/44457251

LeetCode 专栏收录该内容

62 篇文章

订阅专栏

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 you optimize your algorithm to use only O(k) extra space?

class Solution:
    # @return a list of integers
    def getRow(self, rowIndex):
            result = []
            for i in range(rowIndex+1):                                                              result.append(self.func(rowIndex) / (self.func(i) * self.func(rowIndex-i)))
            return result
    def func(self, k):
        sum = 1
        for i in range(1, k+1):
            sum = sum * i
        return sum