119. Pascal‘s Triangle II. Sol

Easy难度的题目，其实是二项式展开，不需要递归就可以了
 
Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.
In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:

Example 1:
Input: rowIndex = 3
Output: [1,3,3,1]

Example 2:
Input: rowIndex = 0
Output: [1]

Example 3:
Input: rowIndex = 1
Output: [1,1]

Constraints:
0 <= rowIndex <= 33 class Solution: def fraction(self, n): product = 1 if

119. Pascal‘s Triangle II. Sol最先出现在Python成神之路。