[leetcode_118]Pascal’s Triangle

简单的数组或者vector操作,一次AC
找找上下行的关系。
附上代码:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        vector<vector<int>> ans(numRows);
        for(int i = 1; i <= numRows; i++)
        {
            vector<int> tmp(i);
            if(i == 1)
            {
                tmp[0] = 1;
                ans[i-1] = tmp;
                continue;
            }
            if(i == 2)
            {
                tmp[0] = 1;
                tmp[1] = 1;
                ans[i-1] = tmp;
                continue;
            }
            tmp[0] = 1;
            tmp[i-1] = 1;
            for(int j = 1; j < i-1; j++)
            {
                tmp[j] = ans[i-2][j-1] + ans[i-2][j];
            }
            ans[i-1] = tmp;
        }
        return ans;
    }
};
Licensed under CC BY-NC-SA 4.0