Pascal's Triangle
来源:互联网 发布:淘宝aj比较靠谱的店 编辑:程序博客网 时间:2024/06/16 18:34
题目: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]
]
要得到一个帕斯卡三角,我们只需要找到规律即可。
第k层有k个元素
每层第一个以及最后一个元素值为1
运行结果:
For example, given numRows = 5, Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
要得到一个帕斯卡三角,我们只需要找到规律即可。
第k层有k个元素
每层第一个以及最后一个元素值为1
对于第k(k > 2)层第n(n > 1 && n < k)个元素A[k][n],A[k][n] = A[k-1][n-1] + A[k-1][n]
代码:
#include<iostream>#include<vector>using namespace std;int main(){ int n; cin>>n; vector<vector<int> > vals; vals.resize(n); for(int i = 0; i < n; i++) { vals[i].resize(i + 1); vals[i][0] = 1; vals[i][vals[i].size() - 1] = 1; for(int j = 1; j < vals[i].size() - 1; j++) { vals[i][j] = vals[i - 1][j - 1] + vals[i - 1][j]; } } vector < vector <int> >::iterator it = vals.begin();for( ; it!= vals.end(); ++it){vector <int>::iterator it2 = (*it).begin();for( ; it2!= (*it).end(); ++it2){cout << (*it2) << " ";}cout << endl;} return 0;}
运行结果:
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
- OpenStack REST API 的 SSL 配置
- 【C】求两个数的最大公约数
- 解决服务器和本地中文乱码的问题
- SpringMVC
- 动态规划——数塔问题
- Pascal's Triangle
- leetcode42. Trapping Rain Water
- 20位活跃在Github上的国内技术大牛
- 链表插入排序
- 【codevs】3269 混合背包
- JavaScript
- 七月机器学习之决策树随机森林和adaboost11
- 论文笔记 SSD: Single Shot MultiBox Detector
- 堆的建立&堆排序