[LeetCode]119. Pascal's Triangle II

https://leetcode.com/problems/pascals-triangle-ii/description/

题目描述：Given an index k, return the kth row of the Pascal’s triangle.

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

解题思路:先求出pascal矩阵，在返回第i行的结果。

public List<Integer> getRow(int rowIndex){
        List<List<Integer>> resList = new ArrayList<List<Integer>>();
        ArrayList<Integer> row = new ArrayList<Integer>();
        row.add(1);
        resList.add(row);
        if(rowIndex==0){
            return row;
        }else{
            for(int i=0;i<rowIndex;i++){
                List<Integer> lastRow = resList.get(i);
                ArrayList<Integer> nowRow = new ArrayList<Integer>();
                nowRow.add(1);
                for(int j=0;j<lastRow.size()-1;j++){
                    nowRow.add(lastRow.get(j)+lastRow.get(j+1));
                }
                nowRow.add(1);
                resList.add(nowRow);
            }
        }
        return resList.get(rowIndex);

    }