Pascal's Triangle

2019独角兽企业重金招聘Python工程师标准>>>

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

class Solution {
    public List<List<Integer>> generate(int numRows) {
        List<Integer> row = new ArrayList<>();
        List<List<Integer>> rst = new ArrayList<>();
		
        if (numRows > 0) {
            row.add(1);
            rst.add(row);
            for (int i = 1; i < numRows; ++ i) {
                row = new ArrayList<>();
                row.add(rst.get(i - 1).get(0));
                for (int j = 1; j < i; ++ j) {
                    row.add(rst.get(i - 1).get(j) + rst.get(i - 1).get(j - 1));
                }
                row.add(rst.get(i - 1).get(0));
                rst.add(row);
            }
        }
		
        return rst;
    }
}

 

转载于:https://my.oschina.net/gonglibin/blog/1624528