leetcode 118 Pascal's Triangle(array)

leetcode array 118. Pascal’s Triangle Add to List QuestionEditorial
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>>这种定义的格式直接当成二维数组来进行处理就ok**
vector<vector<int>> generate(int numRows) {
        if(numRows == 0)
        {
            return vector<vector<int>> (); //如果numRows为0，则直接返回空
        }

        vector<vector<int>> result;
        int i = 0;
        int j = 0;
        for(i = 0; i < numRows; i++)
        {
            vector<int> temp;
            for(j = 0; j < i+1; j++ )
            {
                if(i==0 || j==i)
                {
                    temp.push_back(1);//外围的处理
                }
                else
                {
                    temp.push_back(result[i-1][j-1]+result[i-1][j]);
                }
            }

            result.push_back(temp);
        }

        return result;
    }