LeetCode-118&119.Pascal's Triangle

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

Given numRows, generate the first numRows of Pascal's triangle.

For example, given numRows = 5,
Return

[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

public IList<IList<int>> Generate(int numRows) 
    {
        IList<IList<int>> result = new List<IList<int>>();
        if(numRows==0)
        return result;
        IList<int> list = new List<int>();
        list.Add(1);
        result.Add(list);
        for (int i = 1; i < numRows; i++)
        {
            list = new List<int>();
            list.Add(1);
            IList<int> preList = result[i - 1];
            for (int j = 1; j < i; j++)
            {
                list.Add(preList[j - 1] + preList[j]);
            }
            list.Add(1);
            result.Add(list);
        }
        return result;
    }

119 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].

Note:
Could you optimize your algorithm to use only O(k) extra space?

顺序操作

public IList<int> GetRow(int rowIndex) 
    {
        IList<int> res = new List<int>();
        for (int i = 0; i < rowIndex+1; i++)
        {
            res.Add(1);
        }
        
        if (rowIndex < 2)
            return res;
        int t1,t2;
        for (int i = 2; i <= rowIndex; i++)
        {
            t1 = 1;
            for (int j = 1; j < i; j++)
            {
                t2 = res[j];
                res[j] += t1;
                t1 = t2;
            }
        }
        return res;
    }

优化，倒序操作

public IList<int> GetRow(int rowIndex) 
    {
        IList<int> res = new List<int>();
        for (int i = 0; i < rowIndex+1; i++)
            res.Add(1);
        if (rowIndex < 2)
            return res;
        for (int i = 2; i <= rowIndex; i++)
        {
            for (int j =i-1; j >=1; j--)
                res[j] += res[j - 1];
        }
        return res;
    }