64. 最小路径和

给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。
说明：每次只能向下或者向右移动一步。

解法1

带记录的动态规划，自上而下

  class Solution {
   public:
   vector<vector<int>> results;
     int path(vector<vector<int>>& grid, int n, int m ){
           if( n ==0 && m ==0){
               return 0;
           }else if(n==0){              
                return (results[n][m-1]!=-1?results[n][m-1]:path(grid,n,m-1)) + grid[n][m-1];
           }else if( m==0){
                return (results[n-1][m]!=-1?results[n-1][m]:path(grid,n-1,m)) + grid[n-1][m];
           }
        int result = min((results[n][m-1]!=-1?results[n][m-1]:path(grid,n,m-1)) + grid[n][m-1], (results[n-1][m]!=-1?results[n-1][m]:path(grid,n-1,m))+grid[n-1][m]);
           return result;
       }   
   
   
       int minPathSum(vector<vector<int>>& grid) {
           vector<vector<int>> matrix;
           int n = grid.size();
           int m = grid[0].size();
           matrix.resize(n);
           results.resize(n);
           for(int i = 0; i<n; i++){
               matrix[i].resize(m);
               results[i].resize(m,-1);
           }
            for( int i=0; i<n ;i++){
                for(int j =0;j<m;j++){
                    int res = path(grid,i,j);
                    results[i][j] = res;
                }
            }
            return results[n-1][m-1] + grid[n-1][m-1];
       }   
   };

解法2

自下而上动态规划

  class Solution {
   public:
   vector<vector<int>> results;

       int minPathSum(vector<vector<int>>& grid) {
           vector<vector<int>> matrix;
           int n = grid.size();
           int m = grid[0].size();
           results.resize(n);
           for(int i = 0; i<n; i++){
               results[i].resize(m);
           }

            for( int i=0; i<n ;i++){
                for(int j =0;j<m;j++){
                    if( i==0 && j==0){
                        results[i][j] = grid[i][j];
                    }else if( i ==0){
                        results[i][j] = results[i][j-1] + grid[i][j];
                    }else if (j ==0){
                        results[i][j] = results[i-1][j] + grid[i][j];
                    }else{
                        results[i][j] = min(results[i-1][j],results[i][j-1]) + grid[i][j];
                    }
                }
            }

            return results[n-1][m-1];
       }   
   };