leetcode_question_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<vector<int> > generate(int numRows) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int>> matrix;
        if(numRows < 1) return matrix;
        for(int i = 0; i < numRows; ++i)
        {
    		vector<int> tmp;
            if( i == 0)
				tmp.push_back(1);
			else{
				int mid = i/2;
				for(int j = 0; j <= mid; ++j)
				{
					if(j == 0)//matrix[i][j] = 1;
						tmp.push_back(1);
					else{
						//matrix[i][j] = matrix[i-1][j-1] + matrix[i-1][j];
						tmp.push_back(matrix[i-1][j-1] + matrix[i-1][j]);
					}
				}
				++mid;
				while(mid <= i){
					//matrix[i][mid] = matrix[i][i-mid];
					int num = tmp[i-mid];
					tmp.push_back(num);
					++mid;
				}
			}
			matrix.push_back(tmp);
        }
        return matrix;
    }