leetcode 129: Pascal's Triangle

Pascal's Triangle Oct 28 '12 456 / 1018

Given numRows, generate the first numRows of Pascal's triangle.

For example, given numRows = 5,
Return

[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

public class Solution {
    public List<List<Integer>> generate(int numRows) {
        
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        if(numRows<1) return res;
        
        for(int i=0; i<numRows; i++) {
            List<Integer> temp = new ArrayList<Integer>(i+1);
            for(int j=0; j<=i; j++) {
                if(i==0 || j==0 || j==i) temp.add(1);
                else temp.add(res.get(i-1).get(j-1) + res.get(i-1).get(j));
            }
            res.add(temp);
        }
        return res;
    }
}

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        vector<vector<int> > res;
        if(numRows<1) return res;
        
        for(int len=1; len<=numRows; len++){
            vector<int> temp(len);
            for(int i=0;i<len;i++) {
                if(i==0 || i==len-1) temp[i]=1;
                else{
                    temp[i]= res[len-2][i-1] + res[len-2][i];
                }
            }
            res.push_back(temp);
        }
        
        return res;
    }
};