JAVA_Pascal's Triangle_LeetCode 118 Pascal's Triangle 풀이 class Solution { public List generate(int numRows) { List
res = new ArrayList
(); for (int i = 0; i < numRows; i++) { List row = new ArrayList(); for (int j = 0; j <= i; j++) if (j == 0 || j == i){ row.add(1); }else{ row.add(res.get(i-1).get(j-1) + res.get(i-1).get(j)); } res.add(row); } return res; } } * 출처 Level up your coding skills and quickly land a job. This is the best pl...
#
JAVA
#
JAVA_LeetCode118
#
JAVA_PascalsTriangle
#
JAVA_PascalsTriangle_LeetCode118
#
PascalsTriangle_LeetCode118
