JAVA_Pascal's Triangle_LeetCode 118

JAVA_Pascal's Triangle_LeetCode 118 Pascal's Triangle 풀이 class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> res = new ArrayList<List<Integer>>(); for (int i = 0; i < numRows; i++) { List<Integer> row = new ArrayList<Integer>(); 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_Pascal's Triangle_LeetCode 118