一、数组---杨辉三角2

 1 class Solution {
 2 public:
 3     vector<int> getRow(int rowIndex) {
 4         vector<int> res(rowIndex+1,1);
 5         vector<int> tmp;
 6         if(rowIndex<=1) return res;
 7         else{
 8             tmp = getRow(rowIndex-1);
 9             for(int i=0;i<tmp.size()-1;i++){
10                 res[i+1] = tmp[i] + tmp[i+1]
11             }
12         }
13         return res;
14     }
15 };