Leetcode NO.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操作的基本功，没有任何复杂的算法，直接上代码：

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        vector<vector<int>> res;
        for (int i = 0; i < numRows; ++i) {
            vector<int> tmp(i+1, 0);
            tmp[0] = tmp[i] = 1;
            if (i > 1) {
                for (int j = 1; j <= i/2; ++j)
                    tmp[j] = tmp[i-j] = res[i-1][j-1] + res[i-1][j];
            }
            res.push_back(tmp);
        }
        return res;
    }
};