(java)Pascal's Triangle II
来源:互联网 发布:2016淘宝睡衣模特红人 编辑:程序博客网 时间:2024/06/05 05:06
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
思路:我们可以把这个pascal三角用二维数组来解决。
a[i][0]=1,a[i][j]=a[i-1][j-1]+a[i-1][j]
根据此递推式就可以得出a[introws][j]了
代码如下(已通过leetcode)
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> list=new ArrayList<Integer>();
int[][] a= new int[rowIndex+1][rowIndex+1];
for(int i=0;i<rowIndex+1;i++)
a[i][0]=1;
for(int i=1;i<rowIndex+1;i++) {
for(int j=1;j<rowIndex+1;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
for(int i=0;i<rowIndex+1;i++)
list.add(a[rowIndex][i]);
return list;
}
}
0 0
- Pascal's Triangle II (Java)
- (java)Pascal's Triangle II
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle & Pascal's Triangle II
- Pascal's Triangle && Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- leetcode:258 Add Digits-每日编程第二题
- matlab 将数组写入txt
- linux基础(十二)----linux编程基础----与用户交互
- OC-024.OC中多对象的手动内存管理
- Linux学习笔记(二) - sort,uniq,cut,wc 命令详解
- (java)Pascal's Triangle II
- 【剑指offer】之连续子数组的最大和
- 安装完CentOS 7 后必做的七件事
- leetcode:104 Maximum Depth of Binary Tree-每日编程第三题
- BOM与DOM简介
- 解决方案:Jboss修改jsp需要重启才生效
- Ubuntu 安装 wireshark
- 剑指offer系列之二十八:最小的k个数
- ubuntu14.04管理员密码忘记的解决方法