Pascal's Triangle II Leetcode Python java

来源：互联网发布：线性窥孔优化的特点是编辑：程序博客网时间：2024/05/16 06:09

Given an index k, return the k^th row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

Python:

#coding:utf-8class Solution:        def PascalTriangleii(self,k):                if k<0:                        return None                triangle=[]                for i in range(0,k+1):                        sub=[]                        for j in range(i+1):                                if j==0 or j==i:                                        sub.append(1)                                else:                                        sub.add(triangle[i-1][j-1]+triangle[i-1][j])                        triangle.append(sub)                return triangle[k]

java:

java:public class PascalTriangleii{        public List<Integer> solution(int k){                if(k<0){                        return null;                }                List<List<Integer>> triangle=new ArrayList<List>();                for(int i=0;i<=k;i++){                        List<Integer> sub=new ArrayList<Integer>();                        for(int j=0;j<i+1;j++){                                if(j==0 ||j==i){                                        sub.add(1);                                }                                else{                                        sub.add(triangle.get(i-1).get(j-1)+triangle.get(i-1).get(j));                                }                        }                        triangle.add(sub);                }                return triangle.get(k)        }}

0 0