Leetcode Minimum Path Sum 相关代码,使用dp算法完成,使用down-up方法完成,使用c++编写代码,并提供简单的测试。
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int minPathSum(vector<vector<int> >& grid) {
if (grid.size() == 0) {
return 0;
}
if (grid[0].size() == 0) {
return 0;
}
for (int index = 1; index < grid.size(); index ++) {
grid[index][0] = grid[index][0] + grid[index - 1][0];
}
for (int index = 1; index < grid[0].size(); index ++) {
grid[0][index] = grid[0][index] + grid[0][index - 1];
}
for (int i = 1; i < grid.size(); i ++ ) {
for (int j = 1; j < grid[0].size(); j ++) {
if (grid[i - 1][j] > grid[i][j - 1]) {
grid[i][j] = grid[i][j - 1] + grid[i][j];
} else {
grid[i][j] = grid[i - 1][j] + grid[i][j];
}
}
}
return grid[grid.size() - 1][grid[0].size() - 1];
}
};
int main() {
vector<int> a;
vector<vector<int> > grid;
a.push_back(1);
a.push_back(2);
grid.push_back(a);
a.clear();
a.push_back(1);
a.push_back(1);
grid.push_back(a);
Solution *so = new Solution();
int re = so->minPathSum(grid);
cout<<"the result is: "<<re<<endl;
}