Pascal's 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]
]

解题思路
本题的目的是根据不同的数字，构建不同的三角形。需要注意的就是每个数字的产生特点。

自己的代码

package leetcode;

import java.util.ArrayList;
import java.util.List;

public class PascalsTriangle {
	public List<List<Integer>> generate(int numRows) {
		List<List<Integer>> list = new ArrayList<List<Integer>>();
		if(numRows < 0) return null;
		else if(numRows == 0) return list;
		else{
			for(int times = 1; times <= numRows; times++){
				if(times == 1) {
					List<Integer> tempList = new ArrayList<Integer>();
					tempList.add(1);
					list.add(tempList);
				}
				else if(times == 2){
					List<Integer> tempList = new ArrayList<Integer>();
					tempList.add(1);
					tempList.add(1);
					list.add(tempList);
				}
				else{
					List<Integer> tempList = new ArrayList<Integer>();
					tempList.add(1);
					
					for(int i = 1; i < times-1; i++){
						int num = list.get(times-2).get(i) + list.get(times-2).get(i-1);
						tempList.add(num);
					}
					
					tempList.add(1);
					list.add(tempList);
				}
			}
		}
        return list;
    }
	
	public static void main(String[] args) {
		PascalsTriangle pt = new PascalsTriangle();
		System.out.println(pt.generate(0));
		//System.out.println(pt.generate(1).toString());
		//System.out.println(pt.generate(2).toString());
		//System.out.println(pt.generate(3).toString());
		//System.out.println(pt.generate(4).toString());
		//System.out.println(pt.generate(5).toString());
	}
}