[算法相关] Pascal's Triangle II --杨辉三角形-链表和数组

119. Pascal's Triangle II

   

 

Total Accepted: 72830  Total Submissions: 226423  Difficulty: Easy

 

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

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

如题所示：

public class Solution {
    public List<Integer> getRow(int numRows) {
    List<List<Integer>> allrows = new ArrayList<List<Integer>>();
    ArrayList<Integer> row = new ArrayList<Integer>();
    for(int i=0;i<numRows+1;i++)
    {
        row.add(0, 1);
        for(int j=1;j<row.size()-1;j++)
            row.set(j, row.get(j)+row.get(j+1));
            allrows.add(new ArrayList<Integer>(row));
    }
    return row;
    }
}