【LeetCode】64. Minimum Path Sum

最新推荐文章于 2021-07-23 19:32:26 发布

Freeman_zxp

最新推荐文章于 2021-07-23 19:32:26 发布

阅读量96

点赞数

分类专栏：基础算法文章标签： leetcode c++ 算法

本文链接：https://blog.csdn.net/zpalyq110/article/details/86417819

版权

基础算法专栏收录该内容

72 篇文章 0 订阅

订阅专栏

64. Minimum Path Sum

Description：
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. Unique Paths
Difficulty：Medium
Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

方法1：Dynamic Programming

Time complexity : $O\left ( n^{2} \right )$
Space complexity : $O\left ( m*n\right )$
思路：
P[i][j] = min(P[i - 1][j], P[i][j - 1]) + grid[i][j]

class Solution {
public:
	int minPathSum(vector<vector<int>>& grid) {
		int m = grid.size();
		int n = grid[0].size();
		vector<vector<int>> dp(m, vector<int>(n, grid[0][0]));
		for (int i = 1; i < m; i++)
			dp[i][0] = dp[i - 1][0] + grid[i][0];
		for (int j = 1; j < n; j++)
			dp[0][j] = dp[0][j - 1] + grid[0][j];
		for (int i = 1; i < m; i++) 
			for (int j = 1; j < n; j++) 
				dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
		return dp[m - 1][n - 1];
	}
};

方法2：空间优化

Time complexity : $O\left ( n^{2} \right )$
Space complexity : $O\left ( m\right )$
思路：
用一位数组代替二维数组，长度为短边数。

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<int> cur(m, grid[0][0]);
        for (int i = 1; i < m; i++)
            cur[i] = cur[i - 1] + grid[i][0]; 
        for (int j = 1; j < n; j++) {
            cur[0] += grid[0][j]; 
            for (int i = 1; i < m; i++)
                cur[i] = min(cur[i - 1], cur[i]) + grid[i][j];
        }
        return cur[m - 1];
    }
};