human
Solve in Python:
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?
 ... Can you provide a the Python program you requested?
assistant
#Here is the Python program you requested.

class Solution:
     def getRow(self, rowIndex):
         """
         :type rowIndex: int
         :rtype: List[int]
         """
         if rowIndex < 0:
             return list()
         if rowIndex == 0:
             return list([1])
         l = list([1])
         for i in range(1,rowIndex+1):
             pre_value = l[0] #1
             for j in range(1,i):#j = 3
                 temp = l[j] #1
                 l[j] = pre_value+l[j] #4
                 pre_value = temp #1
             l.append(1)
         return l