Leetcode 118. Pascal's Triangle (Easy) (cpp)

Leetcode 118. Pascal's Triangle (Easy) (cpp)

Tag: Array

Difficulty: Easy

/*

118. Pascal's Triangle (Easy)

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>> vec;
		if (numRows <= 0) {
            return vec;
        }
        vec.push_back(vector<int>(1, 1));
        for (int i = 1; i < numRows; i++) {
            vector<int> res(1, 1);
            for (int j = 0, k = 1; k < vec[i - 1].size(); j++, k++) {
                res.push_back(vec[i - 1][j] + vec[i - 1][k]);
            }
            res.push_back(1);
            vec.push_back(res);
        }
        return vec;
    }
};