119. Pascal's Triangle II

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int > res;
        if(rowIndex==0){
            res.push_back(1);
            return res;
        }
        vector<int> pre ;
        pre.push_back(1);
        vector<int> cur;
        for(int i = 0 ; i <= rowIndex ; i++){
            
            for(int j = 0 ; j <= i ;j++){
                if(j == 0){
                    cur.push_back(1);
                }
                if(j>0 && j<i){
                    cur.push_back(pre[j-1] + pre[j]);
                }
                if(j==i){
                    cur.push_back(1);
                }
            }
            
            if( i == rowIndex){
                res = cur;
                return res;
            }
            pre.clear();
            pre = cur;
            cur.clear();
        }
        
    }
};