Triangle

动态规划

int minimumTotal (vector<vector<int>>& triangle) {
          for (int i = triangle.size() - ; i >= ; --i)
               for (int j = ; j < i + ; ++j)
                     triangle[i][j] += min(triangle[i + ][j],
                           triangle[i + ][j + ]);
           return triangle [][];
}