LeetCode 64 Minimum Path Sum

最新推荐文章于 2020-12-15 00:15:52 发布

kongfy4307

最新推荐文章于 2020-12-15 00:15:52 发布

阅读量201

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kongfy4307/article/details/71036810

版权

LeetCode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

题目

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.

解法

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