【LeetCode】 118. Pascal's Triangle

来源：互联网发布：linux必备工具编辑：程序博客网时间：2024/06/18 11:23

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 class Solution {    public List<List<Integer>> generate(int numRows) {        List<List<Integer>> list = new ArrayList<List<Integer>>();        if (numRows == 0) {            return list;        }        List<Integer> subList = new ArrayList<Integer>();        subList.add(1);        list.add(subList);        if (numRows == 1) {            return list;        }        subList = new ArrayList<Integer>();        subList.add(1);        subList.add(1);        list.add(subList);        for (int i = 1; i < numRows - 1; i++) {            List<Integer> lastList = list.get(i);            subList = new ArrayList<Integer>();            subList.add(lastList.get(0));            for (int j = 0; j < lastList.size() - 1; j++) {                subList.add(lastList.get(j) + lastList.get(j + 1));            }            subList.add(lastList.get(lastList.size() - 1));            list.add(subList);        }        return list;    }}

0 0