LeetCode: Pascal's Triangle
来源：互联网 发布：mysql给表添加分区 编辑：程序博客网 时间：2024/06/05 15:26
public class Solution { public List<List<Integer>> generate(int numRows) { ArrayList<Integer> levelList = new ArrayList<Integer>(); ArrayList<List<Integer>> treeList = new ArrayList<List<Integer>>(); if(numRows == 0){ return treeList; } if(numRows == 1){ levelList.add(1); treeList.add(levelList); return treeList; } levelList.add(1); treeList.add(levelList); ArrayList<Integer> pre; int size; for(int i=2; i<= numRows; i++){ pre = levelList; levelList = new ArrayList<Integer>(); size = pre.size(); levelList.add(1); for(int j=1; j<size; j++){ levelList.add(pre.get(j-1)+pre.get(j)); } levelList.add(1); treeList.add(levelList); } return treeList; }} 0 0
- 【Leetcode】Pascal's Triangle (Pascal)
- 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 --Leetcode
- LeetCode-Pascal's Triangle
- [leetcode] Pascal's Triangle
- LeetCode - Pascal's Triangle
- 【leetcode】Pascal's Triangle
- LeetCode | Pascal's Triangle
- Pascal's Triangle -leetcode
- [leetcode]Pascal's Triangle
- Leetcode Pascal's Triangle
- 7、利用泛型和反射,让public static <T> T findById(Class<T> clazz, int id)方法,更具一般性
- 第一次c++上机报告-1
- 【Linux命令001】cp命令
- HDU 1106
- 祝贺我的博客访问量过万(访问量：10260次)
- LeetCode: Pascal's Triangle
- 1109. Group Photo (25)
- 开发板uboot信息保存
- 20160314 CodeVS 1005 生日礼物,1031 质数环,1049 棋盘染色
- 简单实现字母快速导航LetterView
- 关于概率期望
- Visual Studio调试小技巧
- python pip 安装包时出错
- iOS开发中那些高效常用的宏
