Given numRows, generate the first numRows of Pascal’s triangle.
For example, given numRows = 5,
Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
解法:
抓住每一行每个数的规律,每行首尾都是1,直接写进去;每行中间的数都是由上一行的相应位置的两个数相加得到的数,写成下面的数组更为直观看出每个数和对应下表的规律:
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
代码如下:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> nums;
if (numRows < 1){
return nums;
}
vector<int> num;
int n;
num.push_back(1);
nums.push_back(num);
num.push_back(1);
nums.push_back(num);
num.clear();
for (int i = 2; i < numRows; i++){
num.push_back(1);
for (int j = 1; j < i; j++){
n = nums[i - 1][j - 1] + nums[i - 1][j];
num.push_back(n);
}
num.push_back(1);
nums.push_back(num);
num.clear();
}
}
Given an index k, return the kth row of the Pascal’s triangle.
For example, given k = 3,
Return [1,3,3,1].
解法一:
利用上面的函数,得到了数组矩阵,直接返回第k行即可。
vector<int> getRow(int rowIndex) {
vector<vector<int>> nums = generate(rowIndex + 1);//直接调用上面的函数
vector<int> result = nums[rowIndex];
return result;
}
解法二:
每次只保存上一行的数据就行。
参考:http://blog.csdn.net/ljiabin/article/details/40304037
vector<int> getRow2(int rowIndex){
vector<int> v;
v.push_back(1);
vector<int> pre(v);
for (int i = 1; i <= rowIndex; i++){
v.clear();
v.push_back(1);
for (int j = 1; j < pre.size(); j++){
v.push_back(pre[j] + pre[j - 1]);
}
v.push_back(1);
pre.clear();
pre = v;
}
return v;
}
解法三:
不太明白这种做法的原理。
参考:http://www.cnblogs.com/felixfang/p/3865135.html
vector<int> getRow3(int rowIndex) {
vector<int> v;
if (rowIndex < 0) return v;
for (int i = 0; i <= rowIndex; ++i){
v.push_back(0);
}
for (int j = 0; j <= rowIndex; ++j){
v[rowIndex] = 1;
for (int k = rowIndex - 1; k > 0; --k){
v[k] = v[k] + v[k - 1];
}
v[0] = 1;
}
return v;
}