Leetcode 119. Pascal's Triangle II
2017-04-06 11:15
393 查看
public class Solution { public List<Integer> getRow(int rowIndex) { List<Integer> list = new ArrayList<Integer>(); if (rowIndex < 0) return list; for (int i = 0; i < rowIndex + 1; i++) { list.add(0, 1); // insert 1 at position 0 for (int j = 1; j < list.size() - 1; j++) { list.set(j, list.get(j) + list.get(j + 1)); } } return list; } }
相关文章推荐
- Leetcode#119. Pascal's Triangle II(杨辉三角II)
- [LeetCode]119 Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- [LeetCode] 119. Pascal's Triangle II
- leetcode119~Pascal's Triangle II
- LeetCode-119:Pascal's Triangle II (返回杨辉三角指定行)
- [LeetCode By Python]119. Pascal's Triangle II
- LeetCode119. Pascal's Triangle II
- [C语言] leetcode 119. Pascal's Triangle II
- 【Leetcode】119. Pascal's Triangle II
- [LeetCode][119. Pascal's Triangle II][easy]Java实现,杨辉三角
- 【leetcode】119. Pascal's Triangle II
- [leetcode]#119. Pascal's Triangle II
- LeetCode-119. Pascal's Triangle II
- 119. Pascal's triangle II Leetcode Python
- leetcode_question_119 Pascal's Triangle II
- 【Leetcode】119. Pascal's Triangle II
- leetcode:119 Pascal's Triangle II-每日编程第二十五题
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
- LeetCode 119:Pascal's Triangle II