Title
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?
就是二项式那个表，其实吧，可以用二项式定理做的
Solution
//cpp:
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> v(rowIndex + 1);
v[0] = 1;
for (int i = 0; i <= rowIndex; ++i)
{
for (int j = i; j > 0; --j)
{
v[j] = v[j] + v[j - 1];
}
}
return v;
}
};