[leetcode]118. Pascal's Triangle

// 也叫杨辉三角 class Solution {public:    vector<vector<int>> generate(int numRows) {        vector<vector<int>> ret;        vector<int> cur;        if(numRows==0)            return ret;                    cur.push_back(1);        ret.push_back(cur);                for(int i=1;i<numRows;i++)        {            vector<int> cur1=cur;            cur1.insert(cur1.begin(),0);            cur.push_back(0);            for(int i=0;i<cur.size();i++)            {                cur[i]+=cur1[i];            }            ret.push_back(cur);        }        return ret;    }};