[LeetCode]118 Pascal's Triangle
2015-01-06 17:04
225 查看
https://oj.leetcode.com/problems/pascals-triangle/
http://blog.csdn.net/linhuanmars/article/details/23311527
http://blog.csdn.net/linhuanmars/article/details/23311527
public class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> toReturn = new ArrayList<>(); if (numRows == 0) return toReturn; List<Integer> firstRow = Collections.<Integer> singletonList(1); toReturn.add(firstRow); for (int i = 1 ; i < numRows ; i ++) { List<Integer> lastRow = toReturn.get(toReturn.size() - 1); List<Integer> newRow = newRow(lastRow); toReturn.add(newRow); } return toReturn; } private List<Integer> newRow(List<Integer> lastRow) { int len = lastRow.size() + 1; List<Integer> toReturn = new ArrayList<>(len); for (int i = 0 ; i < len ; i ++) { toReturn.add(value(lastRow, i - 1) + value(lastRow , i)); } return toReturn; } private int value(List<Integer> v , int n) { if (n < 0 || n >= v.size()) return 0; return v.get(n); } }
相关文章推荐
- leetcode 生成杨辉三角形, 118 119 Pascal's Triangle 1,2
- leetcode[118]Pascal's Triangle
- [LeetCode]题解(python):118-Pascal's Triangle
- Leetcode 118 Pascal's Triangle 数论递推
- Leetcode #118 Pascal's Triangle
- [LeetCode 题解]: Pascal's Triangle
- LeetCode(118) Pascal's Triangle
- LeetCode(30)-Pascal's Triangle
- LeetCode——Pascal's Triangle
- [LeetCode 118] - 杨辉三角形(Pascal's Triangle)
- LeetCode(118) Pascal's Triangle
- [LeetCode] Pascal's Triangle
- leetcode Pascal's Triangle
- LeetCode#118 Pascal's Triangle
- [leetcode 118]Pascal's triangle
- [LeetCode] Pascal's Triangle
- LeetCode - Refresh - Pascal's Triangle
- LeetCode-Pascal's Triangle
- Leetcode: Pascal's Triangle
- [LeetCode]Pascal's Triangle