Leetcode.118 Pascals Triangle 杨辉三角
Given an integer numRows, return the first numRows of Pascal’s triangle. In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown: Example 1: Input: numRows = 5 Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]] Example 2: Input: numRows = 1 Output: [[1]] Constraints: 1 <= numRows <= 30 解题思路 这道题比较简单，可以递归，也可以
Posted by Yuanyeex on Monday, July 15, 2019
