[LeetCode]Pascal Triangle II

class Solution {
public:
	vector<int> getRow(int rowIndex) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> ans(rowIndex+2, 0);
		vector<int> tmp(rowIndex+2, 0);
		ans[1] = 1;//first row
		for(int i = 1; i <= rowIndex; ++i)
		{
			tmp = ans;
			for(int j = 1; j <= i+1; ++j)
				ans[j] = tmp[j-1]+tmp[j];
		}
		ans.erase(ans.begin());//delete prefix zero
		return ans;
    }

};