LeetCode OJ 118. 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]
]

Subscribe to see which companies asked this question

【思路】

这道题目很简单，代码如下：

 1 public class Solution {
 2     public List<List<Integer>> generate(int numRows) {
 3         List<List<Integer>> Pascal = new ArrayList<>();
 4         if(numRows == 0) return Pascal;
 5         List<Integer> list = new ArrayList<>();
 6         list.add(1);
 7         Pascal.add(list);
 8         if(numRows == 1) return Pascal;
 9         
10         for(int i = 1; i < numRows; i++){
11             list = new ArrayList<>();
12             list.add(1);
13             List<Integer> prelist = Pascal.get(i-1);
14             int prelen = prelist.size();
15             for(int j = 0; j < prelen - 1; j++){
16                 list.add(prelist.get(j) + prelist.get(j+1));
17             }
18             list.add(1);
19             Pascal.add(list);
20         }
21         return Pascal;
22     }
23 }

 

posted @ 2016-05-20 16:11  Black_Knight  阅读(158)  评论(0)  编辑  收藏  举报