JAVA_Pascal's Triangle II_LeetCode 119

JAVA_Pascal's Triangle II_LeetCode 119 Pascal's Triangle II 풀이 class Solution { public List<Integer> getRow(int rowIndex) { List<Integer> ret = new LinkedList<Integer>(); for (int row = 0; row <= rowIndex; row++) { ret.add(0, 1); for (int i = 1; i < row; i++) ret.set(i, ret.get(i) + ret.get(i + 1)); } return ret; } } * 출처 Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...

원문링크 : JAVA_Pascal's Triangle II_LeetCode 119