[LeetCode118]Pascal's Triangle

题目:

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>> vec1;for(int i = 0; i < numRows; ++i){vector<int> vec2;vec2.push_back(1);for(int j = 1; j < i; ++j){int tmp = vec1[i-1][j-1] + vec1[i-1][j];vec2.push_back(tmp);}if(i != 0)vec2.push_back(1);vec1.push_back(vec2);}return vec1;}
};

[LeetCode118]Pascal's Triangle相关推荐

帕斯卡三角形(Pascal's triangle)
// The following code is compiled on VC2005 // #include "stdafx.h" /*--------------------- ...
[leedcode 118] Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Retu ...
Leetcode 118:Pascal's Triangle 杨辉三角
118:Pascal's Triangle 杨辉三角 Given a non-negative integer numRows, generate the first numRows of Pasca ...
LeetCode Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
LeetCode Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Retu ...
119. Pascal's Triangle II (Graph; WFS)
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
【LeetCode从零单排】No118 Pascal's Triangle
题目 Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, R ...
[Array]Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
C++Pascal‘s Triangle杨辉三角的实现算法
C++Pascal's Triangle杨辉三角的实现算法 C++Pascal's Triangle杨辉三角的实现算法完整源码(定义,实现,main函数测试) C++Pascal's Triangle ...

[LeetCode118]Pascal's Triangle

[LeetCode118]Pascal's Triangle相关推荐

最新文章

热门文章