Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Example:
Input: 5 Output: [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
题目:输入一个非负整数numRows,生成杨辉三角的前numRows行。
实现思路:利用三个特点即可求解,①第i行共有i个数;②第i行的首、尾数字都是1;③第i行(i>=3)的第j个数(j非首非尾)=第i-1行的第j个数+第i-1行的第j-1个数。
class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> result = new ArrayList<>();
for (int size = 1; size <= numRows; size++) {
List<Integer> row = new ArrayList<>();
List<Integer> lastRow = size >= 3 ? result.get(size - 2) : null;
for (int p = 0; p < size; p++) {
if (p == 0) {
row.add(1);
continue;
}
if (p == size - 1) {
row.add(1);
break;
}
if (lastRow != null) row.add(lastRow.get(p) + lastRow.get(p - 1));
}
result.add(row);
}
return result;
}
}