Total Accepted: 62630
Total Submissions: 202421
Difficulty: Easy
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?
Subscribe to see which companies asked this question
Hide Similar Problems
code:
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> A(rowIndex + 1, 0);
A[0] = 1;
for(int i=0;i < rowIndex + 1;i++)
for(int j=i;j>0;j--) {
A[j] = A[j - 1] + A[j];
}
return A;
}
};