Pascal's Triangle

最新推荐文章于 2024-06-05 14:21:17 发布

Nereus_Li

最新推荐文章于 2024-06-05 14:21:17 发布

阅读量498

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/li_chihang/article/details/44497677

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

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]
]

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<vector<int> > generate(int numRows) {
	vector<vector<int>> Result;
	if (numRows == 0)
		return Result;
	vector<int> firstrow(1, 1);
	Result.push_back(firstrow);
	for (int i = 1; i != numRows;++i)
	{
		vector<int> Irows(i + 1, 1);
		for (int j = 1; j != i;++j)
			Irows[j] = Result.back()[j - 1] + Result.back()[j];
		Result.push_back(Irows);
	}
	return Result;
}