LeetCode——Pascal's Triangle II
Description:
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<List<Integer>> list = new ArrayList<List<Integer>>(); for(int i=0; i<=rowIndex; i++) { List<Integer> tList = new ArrayList<Integer>(); if(i == 0) { tList.add(1); } else { for(int j=0; j<=i; j++) { if(j == 0 || j == i) { tList.add(1); } else { tList.add(list.get(i-1).get(j) + list.get(i-1).get(j-1)); } } } list.add(tList); } return list.get(rowIndex); } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112835275-168981902.gif)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112841431-2047172832.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112847494-1544911856.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112904385-918783221.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111120143119-1302805212.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112856369-1466718103.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111112830416-794416355.jpg)
![](https://images2015.cnblogs.com/blog/735119/201701/735119-20170111113919510-1155220901.gif)