leetcode-118、119-杨辉三角

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

public IList> Generate(int numRows) {
        IList> resultList=new List>();
        if (numRows > 0)
        {
            resultList.Add(new List() { 1 });
            for (int i = 2; i <= numRows; ++i)
            {
                List listAdd= new List();
                IList listLast = resultList[i - 2];
                for (int j = 0; j  
119解题代码 
public IList GetRow(int rowIndex) {
        
        IList resultList=new List();
        if (rowIndex >= 0)
        {
            resultList.Add(1);
            for (int i = 1; i <= rowIndex; ++i)
            {
                resultList.Add((int)((long)resultList[i - 1] * (rowIndex - i + 1) / i));
            }
        }
        return resultList;
    }