题目来源:https://leetcode.com/problems/pascals-triangle/
问题描述
118. Pascal's Triangle
Easy
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
Example:
Input: 5
Output:
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
------------------------------------------------------------
题意
打印杨辉三角
------------------------------------------------------------
思路
模拟
------------------------------------------------------------
代码
class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> ans = new ArrayList<List<Integer>>();
if (numRows == 0) {
return ans;
}
List<Integer> pre = new ArrayList<Integer>();
pre.add(1);
ans.add(pre);
for (int i = 2; i <= numRows; ++i) {
ArrayList<Integer> cur = new ArrayList<Integer>(i);
cur.add(1);
for (int j = 1; j<i-1; ++j) {
cur.add(pre.get(j-1) + pre.get(j));
}
cur.add(1);
ans.add(cur);
pre = cur;
}
return ans;
}
}