leetcode【118】Pascal's Triangle 【c++，打败100%案例】

问题描述：

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

源码：

弱智循环，时间100%，空间100%。

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> result;
        if(numRows == 0)    return result;
        vector<int> tmp;
        for(int i=0; i<numRows; i++){
            tmp.push_back(1);
            for(int j=1; j<i; j++){
                tmp.push_back(result[i-1][j-1] + result[i-1][j]);
            }
            if(i != 0)  tmp.push_back(1);
            result.push_back(tmp);
            tmp.clear();
        }
        return result;
    }
};