LeetCode64 最小路径和

给定一个包含非负整数的 m x n 网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。

说明：每次只能向下或者向右移动一步。

示例:

输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。

//空间复杂度：O(1)
class Solution {
public:
    int minPathSum(vector<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 j = 1; j < n; j++)
            grid[0][j] += grid[0][j-1];
            
        
        for(int i = 1; i < m; i++)
            for(int j = 1; j < n; j++)
                grid[i][j] += min(grid[i][j-1], grid[i-1][j]);
        
        return grid[m-1][n-1];
    }
};


//空间复杂度：O(n)
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        
        int m = grid.size();
        int n = grid[0].size();
        
        vector<int> record(n, 0);
        record[0] = grid[0][0];
        
        for(int j = 1; j < n; j++)
            record[j] = record[j-1] + grid[0][j];
        
        for(int i = 1; i < m; i++){
            record[0] += grid[i][0];
            for(int j = 1; j < n; j++)
                record[j] = grid[i][j] + min(record[j], record[j-1]);
        }
        
        return record[n-1];
    }
};


//空间复杂度：O(n^2)
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        
        int m = grid.size();
        int n = grid[0].size();
        
        vector<vector<int>> record = grid;
        
        for(int j = 1; j < n; j++)
            record[0][j] += record[0][j-1];
        
        for(int i = 1; i < m; i++)
            record[i][0] += record[i-1][0];
        
        for(int i = 1; i < m; i++)
            for(int j = 1; j < n; j++)
                record[i][j] += min(record[i-1][j], record[i][j-1]);
        
        return record[m-1][n-1];
    }
};