LeetCode-118. Pascal's Triangle
2017-12-10 13:39
393 查看
Description:
Solution (C++):
算法分析:
这一道题更多考察的是vector容器的使用。主要使用resize函数。可以这样使用:vector<int> vec;//定义一个空vector容器 vec.resize(num);//重新定义vec的大小
这道题也是类似,由于是个二维矩阵,所以第一层vector数量有numRows个。学会使用vecotr::resize()函数。
程序分析:
有关于vector容器,我在之前有系统的总结过,可参考:C++-std::Vector相关文章推荐
- leetcode刷题记录-118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- Leetcode 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- Leetcode-118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle
- LeetCode——118. Pascal's Triangle
- Leetcode-118. Pascal's Triangle
- [LeetCode]118. Pascal's Triangle
- [LeetCode]118. Pascal's Triangle
- leetcode 118. Pascal's Triangle 解题报告
- Leetcode 118. Pascal's Triangle
- [LeetCode]118. Pascal's Triangle
- 【leetcode】118. Pascal's Triangle【java】
- LeetCode118. Pascal's Triangle
- LeetCode 118. Pascal's Triangle