Given an integer numRows, return the first numRows of Pascal’s triangle.
In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:

前幾天做的動態規劃題好難嗚嗚，做道水題找回自信~

狀態轉移方程
triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j]

邊界條件
triangle[0][0] = triangle[i][0] = triangle[i][i] = 1

代碼

class Solution { public:vector<vector<int>> generate(int numRows) {vector<vector<int>> triangle;vector<int> temp;for(int i = 0; i < numRows; i++){temp.clear();temp.push_back(1);for(int j = 1; j < i; j++){temp.push_back(triangle[i-1][j-1] + triangle[i-1][j]);}if(i != 0)temp.push_back(1);triangle.push_back(temp);}return triangle;} };

總結

以上是生活随笔為你收集整理的LeetCode动态规划 杨辉三角的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。