Pascal's Triangle
来源:互联网 发布:import form js 编辑:程序博客网 时间:2024/06/06 12:31
Problem:
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]
杨辉三角。
Solution:
public class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> result = new ArrayList<>();
if(numRows<=0)
return result;
ArrayList<Integer> list = new ArrayList<>();
list.add(1);
result.add(list);
for (int i = 1; i < numRows; i++) {
list = new ArrayList<>();
for(int j=0;j<=i;j++)
{
if(j==0||j==i)
list.add(1);
else
list.add(result.get(i-1).get(j-1)+result.get(i-1).get(j));
}
result.add(list);
}
return result;
}
}
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> result = new ArrayList<>();
if(numRows<=0)
return result;
ArrayList<Integer> list = new ArrayList<>();
list.add(1);
result.add(list);
for (int i = 1; i < numRows; i++) {
list = new ArrayList<>();
for(int j=0;j<=i;j++)
{
if(j==0||j==i)
list.add(1);
else
list.add(result.get(i-1).get(j-1)+result.get(i-1).get(j));
}
result.add(list);
}
return result;
}
}
0 0
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle Pascal's Triangle||
- Pascal's Triangle & Pascal's Triangle II
- Pascal's Triangle && Pascal's Triangle II
- 【Leetcode】Pascal's Triangle (Pascal)
- LeetCode Pascal's Triangle
- [Leetcode] Pascal's Triangle
- LeetCode: Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- [LeetCode] Pascal's Triangle
- 【leetcode】Pascal's Triangle
- [118]Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- LeetCode - Pascal's Triangle
- Pascal's Triangle
- Best Time to Buy and Sell Stock III
- Android事件模型-事件分发机制
- 每一种职业都有其魅力所在,感人所在,坚持自己的梦想,不为什么,只为那份坚持!
- Triangle
- Single Number II
- Pascal's Triangle
- linux常见权限相关错误及解决
- Pascal's Triangle II
- hdu3072——Intelligence System
- Populating Next Right Pointers in Each Node
- 2014年9月15日 停车费应该上涨吗
- Populating Next Right Pointers in Each Node II
- Distinct Subsequences
- Flatten Binary Tree to Linked List