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

很简单的题目杨辉三角，这里用first 记录前一行的数据，seond记录当前处理的行，second头和尾都是1，其他数字是first对应的位置和。

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        vector< vector<int> > result;
		if (numRows == 0) return result;
		vector<int> first, second;
		for (int i = 0; i < numRows; ++i)
		{
			for (int j = 0; j <= i; ++j)
			{
				if (j == 0 || j == i) second.push_back(1);
				else
				{
					second.push_back(first[j - 1] + first[j]);
				}
			}
			first.assign(second.begin(), second.end());
			result.push_back(first);
			second.clear();
		}
    }
};