leetcode 之 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]
]

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