public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> result = new ArrayList<Integer>();
if (rowIndex < 0) {
return result;
}
result.add(1);
for (int i = 0; i < rowIndex; i++) {
result.add(1);
for (int j = i; j > 0; j--) {
result.set(j, result.get(j) + result.get(j - 1));
}
}
return result;
}
}
Pascal's Triangle II
最新推荐文章于 2022-02-27 22:46:37 发布