LeetCode 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]
]

题意：给出行数，输出杨辉三角

思路：第一行输出1，第二行输出[1，1]，第三行除了首尾为1外，其余的为上一行的两个相邻的和

public class Solution {public List<List<Integer>> generate(int numRows) {List<List<Integer>> ans = new ArrayList<List<Integer>>();for (int i = 0; i < numRows; i++) {ArrayList<Integer> arrList = new ArrayList<Integer>();if (i == 0) {arrList.add(1);ans.add(arrList);} else if (i == 1) {arrList.add(1);arrList.add(1);ans.add(arrList);} else {arrList.add(1);List<Integer> prev = ans.get(i - 1);for (int j = 1, len = prev.size(); j < len; j++) {int tmp = prev.get(j - 1) + prev.get(j);arrList.add(tmp);}arrList.add(1);ans.add(arrList);}      }return ans;}
}

LeetCode Pascal's Triangle相关推荐

LeetCode Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
Leetcode: Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
LeetCode——Pascal#39;s Triangle
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Retu ...
LeetCode - Easy - 119. Pascal‘s Triangle II
Topic Array Description https://leetcode.com/problems/pascals-triangle-ii/ Given an integer rowIndex ...
LeetCode - Easy - 118. Pascal‘s Triangle
Topic Array Description https://leetcode.com/problems/pascals-triangle/ Given a non-negative integer ...
[LeetCode]119.Pascal's Triangle II
版权声明:本文为博主原创文章,未经博主允许不得转载. https://blog.csdn.net/SunnyYoona/article/details/43562603 题目 Given an ind ...
leetcode python3 简单题119. Pascal's Triangle II
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十九题 (1)题目英文: Given a non-negative ind ...
leetcode python3 简单题118. Pascal's Triangle
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十八题 (1)题目英文: Given a non-negative int ...
LeetCode 118 Pascal's Triangle（帕斯卡三角形）（vector）
翻译给定一个行数字,生成它的帕斯卡三角形.例如,给定numRows = 5, 返回: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1] ] 原文 Given numR ...

LeetCode Pascal's Triangle

LeetCode Pascal's Triangle相关推荐

最新文章

热门文章