문돌이 존버/프로그래밍 스터디
2021. 10. 10.
(leetcode 문제 풀이) Pascal's 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 List[List[int]]: res = [[1] * i for i in range(1, numRows + 1)] for r in range(2, len(res)): f..
