LeetCode -- 118. 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]
]

---

思路：
本题主要考查vector 的基本操作，杨辉三角形的计算公式：

$$Triangle[i][j]=\left\{ \begin{array}{cc} 1, &j = 0或j=i；\\ Triangle[i-1][j-1]+Triangle[i-1][j],&i=2;\\ \end{array} \right.$$

---

C++代码如下：

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> Triangle(numRows);
        for(int i=0;i<numRows;++i){
            Triangle[i].resize(i+1);
            Triangle[i][0] = 1;
            Triangle[i][i] = 1;
            for(int j=1;j<i;++j){
                Triangle[i][j] = Triangle[i-1][j-1] + Triangle[i-1][j];
            }
        }
        return Triangle;
    }
};