[LeetCode]题解（python）：119 Pascal's Triangle II

题目来源

---

https://leetcode.com/problems/pascals-triangle-ii/

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

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

---

题意分析

---

Input:integer

Output:kth row of the Pascal's triangle

Conditions:只返回第n行

---

题目思路

---

同118，不同之处在于只返回某一层，同时注意与上题的下标起点不一样（rowIndex先加个1 = =）

---

AC代码（Python）

class Solution(object):
    def getRow(self, rowIndex):
        """
        :type rowIndex: int
        :rtype: List[int]
        """
        rowIndex += 1
        ans = []
        if rowIndex == 0:
            return []
        for i in range(rowIndex):
            this = []
            for j in range(i+1):
                this.append(1)
            if i > 1:
                for x in range(i - 1):
                    this[x+1] = ans[i-1][x] + ans[i-1][x+1]
            print this
            ans.append(this)
        
        return ans[rowIndex - 1]