119. Pascal's Triangle II

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?

Subscribe to see which companies asked this question

public class Solution {
        private List<Integer> listCreater (List<Integer> a){
        // int [] ret = new int [a.length+1];
        List <Integer> ret =new ArrayList <Integer> ();
        ret.add(1);
        // ret[0]=1;
        // ret[a.length]=1;
        for(int i=1;i<a.size();i++){
            ret.add(a.get(i)+a.get(i-1));
        }
        ret.add(1);
        return ret;
    }
    public List<Integer> getRow(int rowIndex) {
                List <Integer> ret =new ArrayList <Integer> ();
ret.add(1);
        for(int i = 0;i<rowIndex;i++){
            ret=listCreater(ret);
        }
        return ret;
    }
}