LeetCode刷题笔记--118. Pascal's Triangle

118. Pascal's Triangle

Easy

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]
]

这道题挺简单的，直接贴答案。

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> ans;
        ans.clear();
        if(numRows==0)return ans;
        vector<int> t;
        t.clear();
        t.push_back(1);
        ans.push_back(t);
        if(numRows==1)return ans;
        t.push_back(1);
        ans.push_back(t);
        if(numRows==2)return ans;
        for(int i=3;i<=numRows;i++)
        {
            t.clear();
            t.push_back(1);
            int p=i-2;
            int k=0;
            while(p>=1)
            {
                t.push_back(ans[i-2][k]+ans[i-2][k+1]);
                p--;
                k++;
            }
            t.push_back(1);
            ans.push_back(t);
        }
        return ans;
    }
};