Pascal's Triangle
来源:互联网 发布:社交网络 720p mkv 编辑:程序博客网 时间:2024/06/05 10:25
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) { if(numRows == 0) return vector<vector<int> >(0); vector<vector<int> > ivec; int i = 0, j = 0; for(i = 0; i < numRows; i++) { vector<int> vec; for(j = 0; j < i+1; j++) { if(j == 0 || j == i) vec.push_back(1); else vec.push_back(ivec[i-1][j-1] + ivec[i-1][j]); } ivec.push_back(vec); } return ivec; }};
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
- JNI
- Java笔记(字符串操作方法阅兵)
- 软件可靠性方法 学习笔记
- C#中使用split分割字符串的几种方法小结
- CSS3之position
- Pascal's Triangle
- Linux终端的颜色码
- SYSPROCESSES 查看连接
- openjudge 集合加法
- 互联网之殇
- HTML笔记(基本标签)
- UNIX网络编程笔记(6):I/O复用之select函数
- C语言命名
- Android