我的LeetCode代码仓:https://github.com/617076674/LeetCode
原题链接:https://leetcode-cn.com/problems/pascals-triangle/description/
题目描述:
思路:注意numRows为0的情况
时间复杂度和空间复杂度均是O(numRows ^ 2)。
JAVA代码:
public class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> listList = new ArrayList<>();
if(0 == numRows){
return listList;
}
List<Integer> list = new ArrayList<>();
list.add(1);
listList.add(list);
for(int i = 1; i < numRows; i++){
List<Integer> nextList = new ArrayList<>();
nextList.add(1);
for(int j = 0; j < list.size() - 1; j++){
nextList.add(list.get(j) + list.get(j + 1));
}
nextList.add(1);
listList.add(nextList);
list = new ArrayList<>(nextList);
}
return listList;
}
}
LeetCode解题报告: