leetcode-119. Pascal's Triangle II

leetcode-119. Pascal’s Triangle II

题目：

Given an index k, return the kth row of the Pascal’s triangle.

For example, given k = 3,

Return [1,3,3,1].

和上一题一样

public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> list = new ArrayList<Integer>();
list.add(1);
if(rowIndex==0) return list;
List<Integer> replace = new ArrayList<Integer>();;
while(rowIndex-- != 0){
replace = new ArrayList<Integer>();
replace.add(1);
for(int pos = 1; pos < list.size() ; pos++){
replace.add(list.get(pos-1) + (pos < list.size() ? list.get(pos) : 0));
}
replace.add(1);
list = replace;
}
return replace;
}
}