LeetCode 34 Pascal's Triangle
来源:互联网 发布:apache 多核 编辑:程序博客网 时间:2024/04/28 07:24
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 Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> result = new ArrayList<List<Integer>>(); if(numRows == 0) return result; for(int i=0; i<numRows; i++){ List<Integer> row = new ArrayList<Integer>(); row.add(1); if(i > 0){ for(int j=0; j<result.get(i-1).size()-1; j++) row.add(result.get(i-1).get(j) + result.get(i-1).get(j+1)); row.add(1); } result.add(row); } return result; }}
0 0
- LeetCode 34 Pascal's Triangle
- 【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
- java.lang.NoSuchMethodError: javax.persistence.OneToMany.orphanRemoval()Z错误
- 源码编译apache 2.4.10 常见问题
- jsp页面跳转jsp页面时所传递的内容乱码的问题.
- Android ViewFinder
- Android调用webservice
- LeetCode 34 Pascal's Triangle
- Java 并发编程之任务取消 (三)
- Ajax动态加载xml文件内容
- Android 快速开发系列 打造万能的ListView GridView 适配器
- 两个有序数组中找中位数或者第K大的元素
- java学习笔记10
- Stanford ML - Clustering 聚类
- Android音频架构概览
- NoSQL 读书笔记