118. Pascal's Triangle && 119. Pascal's Triangle II
来源:互联网 发布:ipad 电容笔 知乎 编辑:程序博客网 时间:2024/06/07 15:19
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,其余是上一行两两相加组成。
118题是写出全部,119是写出某行
public List<List<Integer>> generate(int n) { List<List<Integer>> r = new ArrayList<List<Integer>>(); if(n == 0) return r; List<Integer> tmp = new ArrayList<Integer>(); tmp.add(1); r.add(tmp); if(n == 1) return r; for(int i = 2;i <= n;i++){ List<Integer> t = new ArrayList<Integer>(); List<Integer> last = r.get(i-2); t.add(1); for(int j = 1;j < last.size();j++){ t.add(last.get(j)+last.get(j-1)); } t.add(1); r.add(t); } return r; }
public List<Integer> getRow(int r) { List<Integer> re = new ArrayList<Integer>(); if(r < 0) return re; re.add(1); if(r == 0) return re; for(int i = 1;i <= r;i++){ int last = 0; for(int j = 0;j < re.size();j++){ int tmp = re.get(j)+last; last = re.get(j); re.set(j,tmp); } re.add(1); } return re; }
0 0
- 118. Pascal's Triangle && 119. Pascal's Triangle II
- 118. Pascal's Triangle&&119. Pascal's Triangle II
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle & Pascal's Triangle II
- Pascal's Triangle && Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 数据结构实验之排序五:归并求逆序数
- android 加载大图片适配问题解决方案
- Java 集合类
- 第7讲项目2——三数最大值
- glob模式
- 118. Pascal's Triangle && 119. Pascal's Triangle II
- 算法_3 : 组合数学:排列组合
- 平衡二叉树
- 数据结构实验之排序六:希尔排序
- 最简单的python命令解析器
- c++自制Redis数据库(三)初步基础框架设计
- [Leetcode]201. Bitwise AND of Numbers Range @python
- Java实现任意矩阵Strassen算法
- 使用DataGridView进行增删改查 并同步到数据库