64. Minimum Path Sum

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.

这道题和62，63题类似

#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
     int minPathSum(vector<vector<int> >& grid)  
    {
        int m=grid.size();
        int n=grid[0].size();
        vector<vector<int> >min_sum(m,vector<int>(n,0));
        int i,j;
        for(i=0;i<m;i++)
            for(j=0;j<n;j++)
            {
                if(i==0&&j==0)
                    min_sum[i][j]=grid[i][j];
                else if(i==0)
                    min_sum[i][j]=grid[i][j]+min_sum[i][j-1];
                else if(j==0)
                    min_sum[i][j]=grid[i][j]+min_sum[i-1][j];
                else
                {
                    int x=grid[i][j]+min_sum[i][j-1];
                    int y=grid[i][j]+min_sum[i-1][j];
                    if(x<y)
                        min_sum[i][j]=x;
                    else
                        min_sum[i][j]=y;
                }
            }
        return min_sum[m-1][n-1];
    }
};
int main()
{
    int m,n,i,j,temp;
    cin>>m>>n;
    vector<vector<int> >grid(m,vector<int>(n,0));
    for(i=0;i<m;i++)
        for(j=0;j<n;j++)
        {
            cin>>temp;
            grid[i][j]=temp;
        }
    Solution solve;
    cout<<solve.minPathSum(grid) <<endl;
    return 0;
}