Algorithm문제풀이: LeetCode의 “118. Pascal's Triangle”
🧑🚀문제링크: https://leetcode.com/problems/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
여러분은 어떻게 접근하시고 또 해결 하셨는지 댓글로 알려주세요~~
* Github link로 남겨주셔도 좋아요!
