Leetcode Pascal's Triangle

    vector<vector<int> > generate(int numRows) {        vector<vector<int> > result;        for(int i = 0; i < numRows; i++){            vector<int> next(i+1,1);            for(int j = 1; j < i; j++){                next[j] = result[result.size()-1][j-1] + result[result.size()-1][j];            }            result.push_back(next);        }        return result;    }