[leetcode]118. Pascal's Triangle

[leetcode]118. Pascal’s Triangle

---

Analysis

新的一天新的刷题，中午吃什么比较好呢—— [好想好想吃冰淇淋啊~]

Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle.
杨辉三角

Implement

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> res;
        if(numRows==0)
            return res;
        vector<int> t1;
        t1.push_back(1);
        res.push_back(t1);
        for(int i=1; i<numRows; i++){
            t1.push_back(0);
            vector<int> t2 = t1;
            for(int j=1; j<=i; j++)
                t2[j] = t1[j-1] + t1[j];
            res.push_back(t2);
            t1 = t2;
        }
        return res;
    }
};