118. Pascal's Triangle
2017-03-08 15:08
405 查看
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
Subscribe to see which companies asked this question.
public class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> re=new ArrayList<List<Integer>>();
if(numRows==0)
return re;
List<Integer> list=new ArrayList<Integer>();
list.add(1);
re.add(list);
for(int i=1;i<numRows;++i){
List<Integer> temp=new ArrayList<Integer>();
temp.add(1);
for(int j=1;j<i;++j)
temp.add(re.get(i-1).get(j-1)+re.get(i-1).get(j));
temp.add(1);
re.add(temp);
}
return re;
}
}
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
Subscribe to see which companies asked this question.
public class Solution {
public List<List<Integer>> generate(int numRows) {
List<List<Integer>> re=new ArrayList<List<Integer>>();
if(numRows==0)
return re;
List<Integer> list=new ArrayList<Integer>();
list.add(1);
re.add(list);
for(int i=1;i<numRows;++i){
List<Integer> temp=new ArrayList<Integer>();
temp.add(1);
for(int j=1;j<i;++j)
temp.add(re.get(i-1).get(j-1)+re.get(i-1).get(j));
temp.add(1);
re.add(temp);
}
return re;
}
}
相关文章推荐
- 118. Pascal's Triangle
- 118/119. Pascal's Triangle/II
- 15算法课程 118. Pascal's Triangle
- LeetCode 118: Pascal's Triangle
- leetcode 生成杨辉三角形, 118 119 Pascal's Triangle 1,2
- Leetcode:118. Pascal's Triangle(JAVA)
- 118. Pascal's Triangle
- leetcode 生成杨辉三角形, 118 119 Pascal's Triangle 1,2
- 118. Pascal's Triangle 容器里放容器(很重要)
- leetcode 118: Pascal's Triangle
- 【leetcode c++】118 Pascal's Triangle
- 【LeetCode】118 Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle (python)
- 118. Pascal's Triangle
- 118. Pascal's Triangle
- [Leetcode] 118. Pascal's Triangle 解题报告
- leetcode118 Pascal's Triangle
- The Solution to Leetcode 118 Pascal's Triangle
- LeetCode - 118/119 - Pascal's Triangle