leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0120.cpp (562B)

0 class Solution { 1 public: 2 int minimumTotal(vector<vector<int>> &triangle) { 3 int h = triangle.size(); 4 5 for (int i = 0; i < h - 1; i++) { 6 vector<int> vec(i + 2, INT_MAX); 7 for (int j = 0; j <= i; j++) { 8 vec[j] = min(vec[j], triangle[i][j]); 9 vec[j + 1] = min(vec[j + 1], triangle[i][j]); 10 } 11 for (int j = 0; j <= i + 1; j++) 12 triangle[i + 1][j] += vec[j]; 13 } 14 return *min_element(triangle.back().begin(), triangle.back().end()); 15 } 16 };