矩阵最短路径

/*ven 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 <vector>#include <iostream>class Solution{public:int minPathSum(std::vector<std::vector<int> >& grid){int m=grid.size();int n=grid[0].size();for(int i=1;i<m;++i)grid[i][0]+=grid[i-1][0];for(int i=1;i<n;++i)grid[0][i]+=grid[0][i-1];for(int i=1;i<m;++i){for(int j=1;j<n;++j){grid[i][j]+=grid[i-1][j]>grid[i][j-1]?grid[i][j-1]:grid[i-1][j];}}return grid[m-1][n-1];}};int main(int argc,char* argv[]){int a1[]={1,2,3};int a2[]={10,2,7};int a3[]={1,10,4};std::vector<std::vector<int> > tem;tem.push_back(std::vector<int>(a1,a1+3));tem.push_back(std::vector<int>(a2,a2+3));tem.push_back(std::vector<int>(a3,a3+3));Solution s;std::cout<<s.minPathSum(tem)<<std::endl;return 0;}