Pascal's Triangle

题目地址：https://leetcode.com/problems/pascals-triangle/

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

就是数学课本中的杨辉三角么，当时数学老师讲得很清楚了，一个值等于它头顶上两个数字的和，边界全部为1。题目本身没什么难点，控制好边界就OK了。

public class PascalsTriangle {
    public List<List<Integer>> generate(int numRows) {

        List<List<Integer>> outerList = new ArrayList<List<Integer>>();
        if (numRows < 0) {
            List<Integer> innerList = new ArrayList<Integer>();
            innerList.add(1);
            outerList.add(innerList);
            return outerList;
        }

        if (numRows == 0)
            return outerList;

        for (int i = 0; i < numRows; i++) {
            List<Integer> innerList = new ArrayList<Integer>();
            if (i == 0) {
                innerList.add(1);
                outerList.add(innerList);
                continue;
            }
            if (i == 1) {
                innerList.add(1);
                innerList.add(1);
                outerList.add(innerList);
                continue;
            }

            List<Integer> t_list = new ArrayList<Integer>(outerList.get(outerList.size() - 1));

            for (int j = 0; j <= t_list.size(); j++) {
                if (j == 0 || j == t_list.size())
                    innerList.add(1);
                else
                    innerList.add(t_list.get(j-1) + t_list.get(j));
            }

            outerList.add(innerList);
        }

        return outerList;
    }

    public static void main(String[] args) {
        PascalsTriangle pascalsTriangle = new PascalsTriangle();
        System.out.println(pascalsTriangle.generate(10));
    }
}