思路:f[i][j]=f[i-1][j-1]+f[i][j],经典的捏
收获:之前写都是用c/c++编写,现在转行java学习到了对根据(i,j)获取"二维数组"中对应的元素
List<List<Integer>> lists = new ArrayList<>();
lists.get(i).get(j);
AcCode:
class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> lists = new ArrayList<>();
for (int i = 0; i < numRows; ++i) {
ArrayList<Integer> list = new ArrayList<>();
for (int j=0;j<=i;++j){
if(j==0||j==i)list.add(1);
else list.add(lists.get(i-1).get(j-1)+lists.get(i-1).get(j));
}
lists.add(list);
}
return lists;
}
}
over~