118 Pascal' Triangle 逻辑已经跟不上了咋整= =
2017-03-14 15:34
405 查看
public class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> result = new ArrayList<List<Integer>>(); if(numRows==0){ return result; // 输入为0的时候,返回[] } List<Integer> firstrow = new ArrayList<Integer>(); firstrow.add(1);//第一行为[1] result.add(firstrow); for(int i=2;i<=numRows;i++){ List<Integer> row = new ArrayList<Integer>(); row.add(1);//每一行的第一个都是1 List<Integer> prerow = result.get(result.size()-1);//就是最终输出的list里面的倒数第二行 现在正在算的是最后一行(循环) for(int j=1;j<i-1;j++){ //这里为什么是i-1呢?:因为最后一个数还是1,直接手动加 row.add(prerow.get(j-1)+prerow.get(j));//剩下来的list的第j个元素等于上一行的第j-1个元素+第j个元素,get用来返回元素 } row.add(1);//最后的一个元素1 result.add(row); } return result; } }
相关文章推荐
- [LeetCode]--118. Pascal's Triangle
- 118. Pascal's Triangle (Easy)
- 118. Pascal's Triangle(uncolved)
- Leetcode 118 Pascal's Triangle
- Leetcode:118. Pascal's Triangle(JAVA)
- 【LeetCode从零单排】No118 Pascal's Triangle
- 118. Pascal's Triangle
- [勇者闯LeetCode] 118. Pascal's Triangle
- leetcode || 118、Pascal's Triangle
- leetcode[118]:Pascal's Triangle
- LeetCode - 118/119 - Pascal's Triangle
- Lettcode_118_Pascal's Triangle
- leetCode#118. Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle
- 【leetcode c++】118 Pascal's Triangle
- LeetCode 118: Pascal's Triangle
- leecode 解题总结:118. Pascal's Triangle
- 118. Pascal's Triangle