标签:
题目描述:
Given an index k, return the kth row of the Pascal‘s triangle.
For example, given k = 3,
Return [1,3,3,1]
.
代码:
class Solution { public: vector<int> getRow(int rowIndex) { vector<int> result(rowIndex+1,0); result[0] = 1; for(int i = 1;i < (rowIndex+1);i++) for(int j = i;j >= 1;j--) result[j] += result[j-1]; } return result; };
标签:
原文地址:http://blog.csdn.net/yao_wust/article/details/46047419