【LeetCode】 119. Pascal's Triangle II
2016-12-20 23:27
316 查看
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return
Note:
Could you optimize your algorithm to use only O(k) extra space?
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < rowIndex + 1; i++) {
list.add(0, 1);
for (int j = 1; j < list.size() - 1; j++) {
list.set(j, list.get(j) + list.get(j + 1));
}
}
return list;
}
}
For example, given k = 3,
Return
[1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < rowIndex + 1; i++) {
list.add(0, 1);
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
- LeetCode 119. Pascal's Triangle II
- LeetCode WIith JS || 119. Pascal's Triangle 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 119. Pascal's Triangle II
- [Leetcode] 119. Pascal's Triangle II 解题报告
- 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(杨辉三角II)
- LeetCode 119. Pascal's Triangle II
- [LeetCode] 119. Pascal's Triangle II
- LeetCode-119:Pascal's Triangle II (返回杨辉三角指定行)
- [LeetCode By Python]119. Pascal's Triangle II
- LeetCode119. Pascal's Triangle II