LeetCode-Pascal's Triangle

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/39228861

时间：2014-9-12

题目

Pascal's Triangle

 Total Accepted: 18751 Total Submissions: 59273My Submissions

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<Integer> list = new ArrayList<Integer>();        int lastnum = 0;        List<List<Integer>> retlist = new ArrayList<List<Integer>> ();        if(numRows == 0){            return retlist;        }                list.add(1);        retlist.add(list);        if(numRows == 1)//i == 0            return retlist;        for(int i = 1 ; i < numRows;i++){            List<Integer> newlist = new ArrayList<Integer>();            newlist.add(1);            for(int j = 1; j < i; j++){              newlist.add(list.get(j) + list.get(j-1));              }            newlist.add(1);            retlist.add(newlist);            list = newlist;        }        return retlist;    }}

结果

My Submissions for Pascal's Triangle

Submit TimeStatusRun TimeLanguage1 minute agoAccepted356 msjava

返回

 LeetCode Solution(持续更新，java>c++)