Leetcode-119. Pascal's Triangle II
2016-10-25 20:54
375 查看
前言:为了后续的实习面试,开始疯狂刷题,非常欢迎志同道合的朋友一起交流。因为时间比较紧张,目前的规划是先过一遍,写出能想到的最优算法,第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN,mcf171专栏。
博客链接:mcf171的博客
——————————————————————————————
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?
这个题目还好吧,粗暴一点就是直接两个数组,优化一点就在一个数组上操作。Your runtime beats 60.27% of java submissions.
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> result = new ArrayList<Integer>();
for(int i = 0 ; i <= rowIndex; i ++){
if(0 == i) result.add(1);
else if(1 == i)result.add(1);
else{
for(int j = 0; j < result.size() - 1; j ++){
result.set(j,result.get(j) + result.get(j + 1));
}
result.add(0,1);
}
}
return result;
}
}
博客链接:mcf171的博客
——————————————————————————————
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return
[1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
这个题目还好吧,粗暴一点就是直接两个数组,优化一点就在一个数组上操作。Your runtime beats 60.27% of java submissions.
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> result = new ArrayList<Integer>();
for(int i = 0 ; i <= rowIndex; i ++){
if(0 == i) result.add(1);
else if(1 == i)result.add(1);
else{
for(int j = 0; j < result.size() - 1; j ++){
result.set(j,result.get(j) + result.get(j + 1));
}
result.add(0,1);
}
}
return result;
}
}
相关文章推荐
- leetcode:119 Pascal's Triangle II-每日编程第二十五题
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
- LeetCode 119:Pascal's Triangle II
- leetcode 119 Pascal's Triangle II(array)
- 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
- 【LeetCode】119. Pascal's Triangle II
- [leetcode]119. Pascal's Triangle II
- 【LeetCode】119 Pascal's Triangle II
- Leetcode_c++: Pascal's TriangleII (119)
- [leetCode]119.Pascal's Triangle II
- ※ Leetcode - Dynamic Programming - 119. Pascal's Triangle II(倒叙滚动数组求解杨辉三角第k行)
- leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II
- 【leetcode】119. Pascal's Triangle II【java】
- LeetCode力扣之119. Pascal's Triangle II
- LeetCode-119-Pascal's Triangle II-E