文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
Pascal's Triangle
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> result;
for(int i = 0; i < numRows; i++) {
vector<int> nums(i + 1, 1);
result.push_back(nums);
for(int j = 1; j < i; j++) {
result[i][j] = result[i - 1][j - 1] + result[i - 1][j];
}
}
return result;
}
};
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
题目 Given a non-negative integer numRows, generate the fir...
Given numRows, generate the first numRows of Pascal's tri...
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
题目 Given a non-negative index k where k ≤ 33, return the ...
Given an index k, return the kth row of the Pascal's tria...
题目： https://leetcode.com/problems/triangle/ Given a trian...
Java 我的想法比较朴素。。 优解，Java，想法很好，巧妙利用了前一行数据
Swift 3.0
Given numRows, generate the first numRows of Pascal's tri...
本文标题：Leetcode 118. Pascal's Trian
本文链接：https://www.haomeiwen.com/subject/fabszftx.html
网友评论