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?

题意：给定一个整数k，给出Pascal三角（杨辉三角）的Kth row（第K行）输出数组；

代码：

class solution{
public:
    vector<int> getRow(int rowIndex){
        vector<int> result(rowIndex+1, 0);
        result[0] = 1;
        for(int i=1; i<rowIndex+1; i++){
            for(int j=i; j>=1; j--){
                result[j] += result[j-1];
            }
        }
        return result;
    }
};

public class Solution{
    public List<Integer> getRow(int rowIndex){
        List<Integer> list = new ArrayList<Integer>();
        if(rowIndex<0)
            return list;

        for(int i=0; i<rowIndex+1; i++){
            list.add(0, 1);
            for(int j=1; j<list.size()-1; j++){
                list.set(j, list.get(j)+list.get(j+1));
            }
        }
        return list;
    }
}