118. Pascal's Triangle
2018-03-02 13:46
309 查看
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]
]
题意:打印相应行数的杨辉三角。
思路:
找规律,动态规划即可。
代码:class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>>t(numRows);
for(int i=0;i<numRows;i++)
{
t[i].resize(i+1);
t[i][0]=1;
t[i][i]=1;
}
for(int i=1;i<numRows;i++)
{
for(int j=1;j<i;j++)
{
t[i][j]=t[i-1][j-1]+t[i-1][j];
}
}
return t;
}
};
Return[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
题意:打印相应行数的杨辉三角。
思路:
找规律,动态规划即可。
代码:class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>>t(numRows);
for(int i=0;i<numRows;i++)
{
t[i].resize(i+1);
t[i][0]=1;
t[i][i]=1;
}
for(int i=1;i<numRows;i++)
{
for(int j=1;j<i;j++)
{
t[i][j]=t[i-1][j-1]+t[i-1][j];
}
}
return t;
}
};
相关文章推荐
- leetcode118~Pascal's Triangle
- 118 Pascal' Triangle 逻辑已经跟不上了咋整= =
- 118. Pascal's Triangle
- FTPrep, 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
- 118/119. Pascal's Triangle/II
- 15算法课程 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 119 Pascal's Triangle 1,2
- 118. Pascal's Triangle 容器里放容器(很重要)
- 118. Pascal's Triangle Leetcode Python