// Source : https://oj.leetcode.com/problems/pascals-triangle-ii/
// Author : Hao Chen
// Date : 2014-06-18
/**********************************************************************************
*
* Given an index k, return the kth row of the Pascal's triangle.
*
* For example, given k = 3,
* Return [1,3,3,1].
*
* Note:
* Could you optimize your algorithm to use only O(k) extra space?
*
*
**********************************************************************************/
#include
#include
#include
using namespace std;
vector getRow(int rowIndex) {
vector v;
for(int i=0; i0; j--){
v[j] += v[j-1];
}
}
v.push_back(1);
return v;
}
void printVector( vector pt)
{
cout << "{ ";
for(int j=0; j