LeetCode 之 Pascal's Triangle — C++ 实现
来源:互联网 发布:wps h5是什么软件 编辑:程序博客网 时间:2024/06/06 09:23
Pascal's Triangle
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]]给定 numRows,生成前 numRows 行杨辉三角。
例如,当 numRows = 5 时,返回
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]分析:
杨辉三角每行第一个和最后一个数为1,其它的数为上一行相邻两个数的和。
class Solution {public: vector<vector<int>> generate(int numRows) { if(numRows == 0) /* 0行 */ return vector<vector<int>>(); int row = 0, col = 0; vector<vector<int>> retVec; while(row < numRows) { vector<int> c; for(col = 0; col <= row; ++col) { c.push_back((col == 0 || col == row)?1:(retVec[row-1][col-1]+retVec[row-1][col])); } retVec.push_back(c); ++row; } return retVec; }};
0 0
- LeetCode 之 Pascal's Triangle — C++ 实现
- leetcode之Pascal's Triangle
- LeetCode 之 Pascal's Triangle
- LeetCode之Pascal's Triangle
- LeetCode之Pascal's Triangle
- leetcode 之 Pascal's Triangle
- LeetCode之Pascal's Triangle
- LeetCode 之 Pascal's Triangle
- leetcode之Pascal's Triangle
- leetcode之Pascal's Triangle
- LeetCode 之 Pascal's Triangle
- leetcode之 Pascal's Triangle && Pascal's Triangle II
- [C++]LeetCode: 7 Pascal's Triangle
- [C++]LeetCode: 8 Pascal's Triangle II
- [leetcode-118]Pascal's Triangle(c++)
- [leetcode-119]Pascal's Triangle II (c++)
- 【leetcode c++】118 Pascal's Triangle
- [C语言][LeetCode][118]Pascal's Triangle
- 关于新手学习心态的体会:聚焦
- OC面向对象
- 如何用JS弹出“有输入框并带有是、否、取消按钮”的对话框。
- iOS 系统相机的调用
- linux 安装 apr
- LeetCode 之 Pascal's Triangle — C++ 实现
- 配置Log4j(很详细)
- char **的用途
- Leetcode_219 Contains Duplicate II
- 输入一棵二叉树,判断该二叉树是否是平衡二叉树。
- smartsvn 8.6.6 for linux 的安装与破解
- 一个python的验证码生成类
- Uva - 101 - The Blocks Problem
- OOAD 学习笔记 七