Pascal's Triangle
来源:互联网 发布:linux yum安装snmp 编辑:程序博客网 时间:2024/05/05 05:41
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]]
Tags
Array
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
/** * @param {number} numRows * @return {number[][]} */var generate = function (numRows) { if (numRows === 0) { return []; } if (numRows === 1) { return [[1]]; } var last = [1]; var ret = []; while (numRows > 0) { var current = []; current.push(1); for (var i = 0; i < last.length - 1; i++) { current.push(last[i] + last[i + 1]); } current.push(1); ret.push(last); last = current; numRows-- } return ret;};
0 0
- 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
- Pascal's Triangle && Pascal's Triangle II
- 【Leetcode】Pascal's Triangle (Pascal)
- LeetCode Pascal's Triangle
- [Leetcode] Pascal's Triangle
- LeetCode: Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- [LeetCode] Pascal's Triangle
- 【leetcode】Pascal's Triangle
- [118]Pascal's Triangle
- Pascal's Triangle
- Pascal's Triangle II
- LeetCode - Pascal's Triangle
- Pascal's Triangle
- 欢迎使用CSDN-markdown编辑器
- Kth Largest Element in an Array
- leecode_307 Range Sum Query - Mutable
- HTTP协议详解(转载)
- Letter Combinations of a Phone Number
- Pascal's Triangle
- Remove Duplicates from Sorted Array
- Increasing Triplet Subsequence
- Binary Tree Level Order Tranversal
- 了解流程类型,第 3 篇:动态消息广告
- 7.1 自由存储区内存分配
- 7.2 浅复制与深复制
- 7.3 链表-单链表的基本算法
- 勾股定理一日一证连载22