[LeetCode]118. Pascal’s Triangle

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

题目描述: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]
]

解题思路:循环，根据规律nowRow=lastRow.get(i)+lastRow.get(i+1)可以遍历得到帕斯卡三角。

public static List<List<Integer>> generate(int numRows){
        List<List<Integer>> resList = new ArrayList<List<Integer>>();
        if(numRows>0){
            ArrayList<Integer> row = new ArrayList<Integer>();
            row.add(1);
            resList.add(row);
        }
        if(numRows>1){
            List<Integer> lastRow = new ArrayList<Integer>();
            for(int i=0;i<numRows-1;i++){
                lastRow = resList.get(i);
                List<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;
    }