[leetcode 118] Pascal's Triangle
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it. Example: Input: 5 Output: [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 문제 풀이 난이도 easy dp로 구현하면 되는 문제이다. 자바로 구현방법 익히기!!! class Solution { public List generate(int numRows) { List tr = new ArrayList(); if(numRows == 0){ return ..
2020. 11. 19.