leetcode118~Pascal's Triangle
来源:互联网 发布:hadoop 1T数据 编辑:程序博客网 时间:2024/05/22 12:13
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]]
public class PascalTriangle { public List<List<Integer>> generate(int rowNums) { //使用集合(与一维数组实现有相似) List<List<Integer>> res = new ArrayList<>(); List<Integer> row = new ArrayList<>(); for(int i=0;i<rowNums;i++) { row.add(0, 1); for(int j=1;j<i;j++) { row.set(j, row.get(j)+row.get(j+1)); } //这里重更新建立新的集合,防止覆盖 res.add(new ArrayList<>(row)); } return res; } //使用二维数组 public List<List<Integer>> generate2(int rowNums) { List<List<Integer>> res = new ArrayList<>(); if(rowNums==0) return res; int[][] arr = new int[rowNums][rowNums]; //初始化 for(int i=0;i<rowNums;i++) { arr[i][0]=1; arr[i][i]=1; } for(int i=2;i<rowNums;i++) { for(int j=1;j<i;j++) { arr[i][j] = arr[i-1][j-1]+arr[i-1][j]; } } for(int i=0;i<arr.length;i++) { List<Integer> list = new ArrayList<>(); for(int j=0;j<=i;j++) { list.add(arr[i][j]); } res.add(list); } return res; }}
0 0
- LeetCode118 Pascal's Triangle
- LeetCode118:Pascal's Triangle
- leetcode118. Pascal's Triangle
- leetcode118~Pascal's Triangle
- LeetCode118 Pascal's Triangle
- leetcode118 Pascal's Triangle
- LeetCode118. Pascal's Triangle
- LeetCode118—Pascal's Triangle
- LeetCode118——Pascal's Triangle
- leetcode118 and 119 Pascal's Triangle
- leetcode118 & 119. [Array]Pascal's Triangle
- Leetcode118. Pascal's Triangle (杨辉三角)
- 杨辉三角(Pascal's Triangle)- LeetCode118-119
- 二维数组的生成-【leetcode118- Pascal's Triangle 】
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle Pascal's Triangle||
- Pascal's Triangle & Pascal's Triangle II
- Android性能优化之利用LeakCanary检测内存泄漏及解决办法(转)
- Nanopi2 挂载U盘
- SpringBoot学习笔记(三):问题--th:replace老是提示解析模板出错
- Surrounded Regions
- Dev C++ 源文件编译时,确实没问题,但是运行时,总是提示源文件 未编译
- leetcode118~Pascal's Triangle
- 讀取影片(VideoCapture)
- Android Studio 修改包名最便捷做法
- PAT 1114
- H3 BPM总部乔迁 开启新篇章 筑梦新征程
- Git主要命令操作详解
- 权限修饰符
- 【hdoj_1865】1sting(递推+大数)
- 架构搭建