// Source : https://oj.leetcode.com/problems/minimum-path-sum/
// Author : Hao Chen
// Date : 2014-06-21
/**********************************************************************************
*
* Given a m x n grid filled with non-negative numbers, find a path from top left to
* bottom right which minimizes the sum of all numbers along its path.
*
* Note: You can only move either down or right at any point in time.
*
**********************************************************************************/
#include
#include
#include
using namespace std;
int minPathSum(vector > &grid) {
if (grid.size()<=0){
return 0;
}
int i, j;
for(i=0; i > grid;
for(int i=0; i<6; i++){
vector v;
for(int j=0; j<2; j++){
v.push_back(a[i][j]);
}
grid.push_back(v);
}
cout << "minPathSum=" << minPathSum(grid) << endl;
return 0;
}