本文主要是介绍118. Pascal‘s Triangle(Leetcode每日一题-2020.12.06),希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
Problem
Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle.
In Pascal’s triangle, each number is the sum of the two numbers directly above it.
Example
Solution
class Solution {
public:vector<vector<int>> generate(int n) {vector<vector<int>> f;for (int i = 0; i < n; i ++ ) {vector<int> line(i + 1);line[0] = line[i] = 1;for (int j = 1; j < i; j ++ )line[j] = f[i - 1][j - 1] + f[i - 1][j];f.push_back(line);}return f;}
};
这篇关于118. Pascal‘s Triangle(Leetcode每日一题-2020.12.06)的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!