118. Pascal's Triangle

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

 

学到了vector的resize()用法...

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